%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC316-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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:09:17 PM UTC 2026
% Result : Unsatisfiable 14.69s 2.87s
% Output : CNFRefutation 14.69s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f251ERROR: Could not build tree for root c_29902ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f75,axiom,
! [X0] :
( nil = X0
| ssList(tl(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
fof(f76,axiom,
! [X0] :
( nil = X0
| ssItem(hd(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f96,axiom,
! [X0,X1] :
( tl(cons(X0,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
fof(f97,axiom,
! [X0,X1] :
( hd(cons(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
fof(f98,axiom,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| nil != cons(X0,X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
fof(f121,axiom,
! [X0,X1] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil = X0
| ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1) ),
inference(reorient_equations,[],[f121]) ).
fof(f125,axiom,
! [X0,X1] :
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
fof(f126,plain,
! [X0,X1] :
( cons(X0,X1) = app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f125]) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f215,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f216,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f218,plain,
( ~ neq(sk4,nil)
| sk3 = app(cons(sk5,nil),sk6) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f220,plain,
( ~ neq(sk4,nil)
| sk4 = app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f219]) ).
tcf(c_254,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_255,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_256,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f249]) ).
tcf(c_262,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_263,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_264,negated_conjecture,
( ( app(cons(sk5,nil),sk6) = sk3 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_265,negated_conjecture,
( ( app(sk6,cons(sk5,nil)) = sk4 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_266,negated_conjecture,
( ~ ssList(sk4)
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| ~ neq(sk4,nil)
| ~ neq(sk3,nil)
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ( app(tl(sk3),cons(hd(sk3),nil)) != sk4 ) ),
inference(cnf_transformation,[],[f251]) ).
tcf(c_268,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i] :
( ( X0 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_271,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_274,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_276,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f254]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_283,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_291,plain,
! [X0: $i,X1: $i] :
( ( tl(cons(X1,X0)) = X0 )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f96]) ).
tcf(c_293,plain,
! [X0: $i] :
( ssList(tl(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_299,plain,
! [X0: $i,X1: $i] :
( ( hd(cons(X1,X0)) = X1 )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f97]) ).
tcf(c_301,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_327,plain,
( ~ ssList(nil)
| ~ neq(nil,nil) ),
inference(instantiation,[status(thm)],[c_276]) ).
tcf(c_337,plain,
( neq(nil,nil)
| ( nil = nil )
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_278]) ).
tcf(c_358,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_263,c_256,c_263]) ).
tcf(c_360,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_262,c_256,c_262]) ).
tcf(c_372,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk4,
inference(global_subsumption_just,[status(thm)],[c_265,c_256,c_265]) ).
tcf(c_374,negated_conjecture,
app(cons(sk5,nil),sk6) = sk3,
inference(global_subsumption_just,[status(thm)],[c_264,c_256,c_264]) ).
tcf(c_378,plain,
( ~ neq(sk3,nil)
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ( app(tl(sk3),cons(hd(sk3),nil)) != sk4 )
| ~ neq(nil,sk3)
| ~ ssItem(hd(sk3)) ),
inference(global_subsumption_just,[status(thm)],[c_266,c_255,c_256,c_266]) ).
tcf(c_379,negated_conjecture,
( ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| ~ neq(sk3,nil)
| ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ( app(tl(sk3),cons(hd(sk3),nil)) != sk4 ) ),
inference(renaming,[status(thm)],[c_378]) ).
tcf(c_2028,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( neq(X0,X2)
| ~ neq(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_3509,plain,
( ( cons(sk5,nil) = nil )
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( sk3 != nil ) ),
inference(superposition,[status(thm)],[c_374,c_270]) ).
tcf(c_3522,plain,
( ( cons(sk5,nil) = nil )
| ~ ssList(cons(sk5,nil))
| ( sk3 != nil ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3509,c_358]) ).
tcf(c_3572,plain,
! [X0: $i] :
( ~ ssItem(sk5)
| ~ ssList(X0)
| ( cons(sk5,X0) != nil ) ),
inference(instantiation,[status(thm)],[c_271]) ).
tcf(c_3573,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ( cons(sk5,nil) != nil ) ),
inference(instantiation,[status(thm)],[c_3572]) ).
tcf(c_3583,plain,
! [X0: $i] :
( ssList(cons(sk5,X0))
| ~ ssItem(sk5)
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_283]) ).
tcf(c_3584,plain,
( ssList(cons(sk5,nil))
| ~ ssItem(sk5)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_3583]) ).
tcf(c_5440,plain,
( ssItem(hd(sk3))
| ( sk3 = nil )
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_301]) ).
tcf(c_5441,plain,
( ssList(tl(sk3))
| ( sk3 = nil )
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_293]) ).
tcf(c_5445,plain,
! [X0: $i] :
( neq(X0,sk3)
| ( sk3 = X0 )
| ~ ssList(sk3)
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_278]) ).
tcf(c_5448,plain,
( neq(nil,sk3)
| ( sk3 = nil )
| ~ ssList(nil)
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_5445]) ).
tcf(c_10664,plain,
! [X0: $i] :
( ssList(cons(hd(sk3),X0))
| ~ ssList(X0)
| ~ ssItem(hd(sk3)) ),
inference(instantiation,[status(thm)],[c_283]) ).
tcf(c_10665,plain,
( ssList(cons(hd(sk3),nil))
| ~ ssList(nil)
| ~ ssItem(hd(sk3)) ),
inference(instantiation,[status(thm)],[c_10664]) ).
tcf(c_12938,plain,
! [X0: $i,X1: $i,X2: $i] :
( neq(X0,X2)
| ~ neq(X1,sk3)
| ( X2 != sk3 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_2028]) ).
tcf(c_12939,plain,
( neq(nil,nil)
| ~ neq(nil,sk3)
| ( nil != nil )
| ( nil != sk3 ) ),
inference(instantiation,[status(thm)],[c_12938]) ).
tcf(c_21031,plain,
( neq(sk3,nil)
| ( nil = sk3 )
| ~ ssList(nil)
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_278]) ).
tcf(c_26450,negated_conjecture,
app(tl(sk3),cons(hd(sk3),nil)) != sk4,
inference(global_subsumption_just,[status(thm)],[c_379,c_254,c_274,c_256,c_262,c_327,c_337,c_379,c_3522,c_3573,c_3584,c_5441,c_5440,c_5448,c_10665,c_12939,c_21031]) ).
tcf(c_26924,plain,
! [X0: $i] :
( ( tl(cons(X0,sk6)) = sk6 )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_358,c_291]) ).
tcf(c_26957,plain,
! [X0: $i] :
( ( hd(cons(X0,sk6)) = X0 )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_358,c_299]) ).
tcf(c_27094,plain,
tl(cons(sk5,sk6)) = sk6,
inference(superposition,[status(thm)],[c_360,c_26924]) ).
tcf(c_27148,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sk6) = cons(X0,sk6) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_358,c_268]) ).
tcf(c_27391,plain,
hd(cons(sk5,sk6)) = sk5,
inference(superposition,[status(thm)],[c_360,c_26957]) ).
tcf(c_29444,plain,
app(cons(sk5,nil),sk6) = cons(sk5,sk6),
inference(superposition,[status(thm)],[c_360,c_27148]) ).
tcf(c_29446,plain,
cons(sk5,sk6) = sk3,
inference(light_normalisation,[status(thm)],[c_29444,c_374]) ).
tcf(c_29451,plain,
hd(sk3) = sk5,
inference(demodulation,[status(thm)],[c_27391,c_29446]) ).
tcf(c_29452,plain,
tl(sk3) = sk6,
inference(demodulation,[status(thm)],[c_27094,c_29446]) ).
tcf(c_29454,plain,
app(sk6,cons(hd(sk3),nil)) != sk4,
inference(demodulation,[status(thm)],[c_26450,c_29452]) ).
tcf(c_29902,plain,
$false,
inference(ground_joinability,[status(thm)],[c_29454,c_372,c_29451]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC316-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 17:35:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 14.69/2.87 % SZS status Started for theBenchmark.p
% 14.69/2.87 % SZS status Unsatisfiable for theBenchmark.p
% 14.69/2.87
% 14.69/2.87 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 14.69/2.87
% 14.69/2.87 % ------ iProver source info
% 14.69/2.87
% 14.69/2.87 % git: date: 2026-07-19 20:42:38 +0200
% 14.69/2.87 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 14.69/2.87 % git: non_committed_changes: false
% 14.69/2.87
% 14.69/2.87 % ------ Parsing...% successful
% 14.69/2.87
% 14.69/2.87
% 14.69/2.87 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 14.69/2.87
% 14.69/2.87 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 14.69/2.87
% 14.69/2.87 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 14.69/2.87
% 14.69/2.87 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.69/2.87 % ------ Proving...
% 14.69/2.87 % ------ Problem Properties
% 14.69/2.87
% 14.69/2.87 %
% 14.69/2.87 % clauses 58
% 14.69/2.87 % conjectures 8
% 14.69/2.87 % EPR 21
% 14.69/2.87 % Horn 43
% 14.69/2.87 % unary 11
% 14.69/2.87 % binary 8
% 14.69/2.87 % lits 208
% 14.69/2.87 % lits eq 48
% 14.69/2.87 % fd_pure 0
% 14.69/2.87 % fd_pseudo 0
% 14.69/2.87 % fd_cond 12
% 14.69/2.87 % fd_pseudo_cond 9
% 14.69/2.87 % AC symbols 0
% 14.69/2.87
% 14.69/2.87 % ------ Schedule dynamic 5 is on
% 14.69/2.87
% 14.69/2.87 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 14.69/2.87
% 14.69/2.87
% 14.69/2.87 % ------
% 14.69/2.87 % Current options:
% 14.69/2.87 % ------
% 14.69/2.87
% 14.69/2.87
% 14.69/2.87 %
% 14.69/2.87
% 14.69/2.87 % ------ Proving...
% 14.69/2.87 %
% 14.69/2.87
% 14.69/2.87 % SZS status Unsatisfiable for theBenchmark.p
% 14.69/2.87
% 14.69/2.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.69/2.88
% 14.69/2.88
%------------------------------------------------------------------------------