%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC134+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:08:02 PM UTC 2026
% Result : Theorem 0.44s 1.29s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f225ERROR: Could not build tree for root c_6086ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax60) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f249,plain,
! [X0] :
( ~ sP1(X0)
| ( ( ~ cyclefreeP(X0)
| sP0(X0) )
& ( ~ sP0(X0)
| cyclefreeP(X0) ) ) ),
inference(nnf_transformation,[],[f224]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ~ cyclefreeP(sK54)
& ~ neq(sK56,nil)
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f319,plain,
! [X0] :
( ~ sP1(X0)
| ~ cyclefreeP(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f320,plain,
! [X0] :
( ~ sP1(X0)
| ~ sP0(X0)
| cyclefreeP(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f330,plain,
! [X0] :
( ~ ssList(X0)
| sP1(X0) ),
inference(cnf_transformation,[],[f225]) ).
fof(f387,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f446,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
~ cyclefreeP(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
~ neq(sK56,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
~ cyclefreeP(sK56),
inference(definition_unfolding,[],[f500,f503]) ).
fof(f505,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f503]) ).
tcf(c_71,plain,
! [X0: $i] :
( cyclefreeP(X0)
| ~ sP1(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f320]) ).
tcf(c_72,plain,
! [X0: $i] :
( sP0(X0)
| ~ sP1(X0)
| ~ cyclefreeP(X0) ),
inference(cnf_transformation,[],[f319]) ).
tcf(c_82,plain,
! [X0: $i] :
( sP1(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f387]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_198,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f446]) ).
tcf(c_246,negated_conjecture,
~ neq(sK56,nil),
inference(cnf_transformation,[],[f501]) ).
tcf(c_247,negated_conjecture,
~ cyclefreeP(sK56),
inference(cnf_transformation,[],[f504]) ).
tcf(c_250,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f505]) ).
tcf(c_264,plain,
( sP1(nil)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_291,plain,
( sP0(nil)
| ~ sP1(nil)
| ~ cyclefreeP(nil) ),
inference(instantiation,[status(thm)],[c_72]) ).
tcf(c_2981,plain,
! [X0: $i,X1: $i] :
( sP0(X1)
| ~ cyclefreeP(X1)
| ~ ssList(X0)
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_82,c_72]) ).
tcf(c_2982,plain,
! [X0: $i] :
( sP0(X0)
| ~ cyclefreeP(X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_2981]) ).
tcf(c_2993,plain,
! [X0: $i,X1: $i] :
( cyclefreeP(X1)
| ~ sP0(X1)
| ~ ssList(X0)
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_82,c_71]) ).
tcf(c_2994,plain,
! [X0: $i] :
( cyclefreeP(X0)
| ~ sP0(X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_2993]) ).
tcf(c_3176,plain,
! [X0: $i] :
( sP0(X0)
| ~ ssList(X0)
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_2982,c_198]) ).
tcf(c_3177,plain,
( sP0(nil)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3176]) ).
tcf(c_3178,plain,
sP0(nil),
inference(global_subsumption_just,[status(thm)],[c_3177,c_198,c_141,c_264,c_291]) ).
tcf(c_3183,plain,
! [X0: $i] :
( ~ sP0(X0)
| ~ ssList(X0)
| ( X0 != sK56 ) ),
inference(resolution_lifted,[status(thm)],[c_2994,c_247]) ).
tcf(c_3184,plain,
( ~ sP0(sK56)
| ~ ssList(sK56) ),
inference(unflattening,[status(thm)],[c_3183]) ).
tcf(c_3185,plain,
~ sP0(sK56),
inference(global_subsumption_just,[status(thm)],[c_3184,c_250,c_3184]) ).
tcf(c_3218,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK56 ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
tcf(c_3219,plain,
( ( sK56 = nil )
| ~ ssList(sK56)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3218]) ).
tcf(c_3220,plain,
sK56 = nil,
inference(global_subsumption_just,[status(thm)],[c_3219,c_250,c_141,c_3219]) ).
tcf(c_6084,plain,
~ sP0(nil),
inference(demodulation,[status(thm)],[c_3185,c_3220]) ).
tcf(c_6086,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6084,c_3178]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC134+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 16:35:24 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 0.44/1.29 % SZS status Started for theBenchmark.p
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/1.29
% 0.44/1.29 % ------ iProver source info
% 0.44/1.29
% 0.44/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/1.29 % git: non_committed_changes: false
% 0.44/1.29
% 0.44/1.29 % ------ Parsing...
% 0.44/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e %
% 0.44/1.29
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.29
% 0.44/1.29
%------------------------------------------------------------------------------