%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC309-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 : n020.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:15 PM UTC 2026
% Result : Unsatisfiable 14.60s 6.02s
% Output : CNFRefutation 14.60s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f241ERROR: Could not build tree for root c_30149ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f9,axiom,
ssItem(skac3),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause9) ).
fof(f13,axiom,
! [X0] : ssList(skaf82(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
fof(f72,axiom,
! [X0,X1] :
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f83,axiom,
! [X0] :
( frontsegP(nil,X0)
| ~ ssList(X0)
| nil != X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
fof(f84,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f112,axiom,
! [X0] :
( nil = X0
| cons(skaf83(X0),skaf82(X0)) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
fof(f125,axiom,
! [X0,X1] :
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/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(f193,axiom,
! [X2,X3,X0,X1,X4] :
( ~ ssList(X4)
| ~ duplicatefreeP(X4)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X0,X1] :
( app(X1,cons(X0,nil)) != sk1
| app(cons(X0,nil),X1) != sk2
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X0,X1] :
( sk1 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk2
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f207]) ).
fof(f209,negated_conjecture,
! [X0,X1] :
( app(cons(X0,nil),X1) != sk4
| app(X1,cons(X0,nil)) = sk3
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f210,plain,
! [X0,X1] :
( app(cons(X0,nil),X1) != sk4
| sk3 = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f209]) ).
fof(f214,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f215,plain,
! [X0,X1] :
( sk3 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk4
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
fof(f218,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f83]) ).
fof(f233,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(equality_resolution,[],[f193]) ).
tcf(c_251,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_252,plain,
ssItem(skac3),
inference(cnf_transformation,[],[f9]) ).
tcf(c_256,plain,
! [X0: $i] : ssList(skaf82(X0)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_315,plain,
! [X0: $i,X1: $i] :
( duplicatefreeP(X0)
| ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_326,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_327,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_328,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_329,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_352,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(skaf83(X0),skaf82(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_358,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f241]) ).
tcf(c_363,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_422,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_431,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_432,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_433,negated_conjecture,
neq(sk4,nil),
inference(cnf_transformation,[],[f214]) ).
tcf(c_434,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(X1,cons(X0,nil)) != sk3 )
| ( app(cons(X0,nil),X1) != sk4 ) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_435,negated_conjecture,
! [X0: $i,X1: $i] :
( ( app(X1,cons(X0,nil)) = sk3 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk4 ) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_482,plain,
( ~ ssList(nil)
| ~ neq(nil,nil) ),
inference(instantiation,[status(thm)],[c_358]) ).
tcf(c_497,plain,
( ( nil = nil )
| ~ ssList(nil)
| ~ frontsegP(nil,nil) ),
inference(instantiation,[status(thm)],[c_327]) ).
tcf(c_558,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X0,nil),X1) != sk4 )
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_435,c_435,c_434]) ).
tcf(c_559,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk4 ) ),
inference(renaming,[status(thm)],[c_558]) ).
tcf(c_561,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk4 ) ),
inference(global_subsumption_just,[status(thm)],[c_434,c_559]) ).
tcf(c_701,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_703,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( neq(X0,X2)
| ~ neq(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_2377,plain,
( ( sk4 = nil )
| ( cons(skaf83(sk4),skaf82(sk4)) = sk4 )
| ~ ssList(sk4) ),
inference(instantiation,[status(thm)],[c_352]) ).
tcf(c_2534,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ~ neq(sk4,nil)
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(instantiation,[status(thm)],[c_703]) ).
tcf(c_2535,plain,
( neq(nil,nil)
| ~ neq(sk4,nil)
| ( nil != nil )
| ( nil != sk4 ) ),
inference(instantiation,[status(thm)],[c_2534]) ).
tcf(c_3317,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(resolution,[status(thm)],[c_422,c_315]) ).
tcf(c_3454,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(cons(X1,X3))
| ~ ssList(app(X0,cons(X1,X2))) ),
inference(resolution,[status(thm)],[c_3317,c_328]) ).
tcf(c_3474,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(app(X0,cons(X1,X2))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3454,c_329]) ).
tcf(c_3493,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(X0,X1)) ),
inference(resolution,[status(thm)],[c_3474,c_328]) ).
tcf(c_3500,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3493,c_329]) ).
tcf(c_3522,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c_3500,c_252]) ).
tcf(c_3602,plain,
! [X0: $i,X1: $i,X2: $i] :
( ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c_3522,c_431]) ).
tcf(c_4087,plain,
! [X0: $i,X1: $i] :
( ssItem(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c_3602,c_431]) ).
tcf(c_4140,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_363,c_4087]) ).
tcf(c_4162,plain,
! [X0: $i] : ssItem(X0),
inference(resolution,[status(thm)],[c_4087,c_431]) ).
tcf(c_8309,plain,
! [X0: $i,X1: $i] :
( ( X0 = sk4 )
| ( sk4 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_701]) ).
tcf(c_8310,plain,
( ( nil = sk4 )
| ( nil != nil )
| ( sk4 != nil ) ),
inference(instantiation,[status(thm)],[c_8309]) ).
tcf(c_28009,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X0,nil),X1) != sk4 )
| ~ ssList(X1) ),
inference(global_subsumption_just,[status(thm)],[c_561,c_559,c_4162]) ).
tcf(c_28010,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk4 ) ),
inference(renaming,[status(thm)],[c_28009]) ).
tcf(c_29183,plain,
( ( sk4 = nil )
| ( cons(skaf83(sk4),skaf82(sk4)) = sk4 ) ),
inference(superposition,[status(thm)],[c_432,c_352]) ).
tcf(c_29215,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_363,c_4140]) ).
tcf(c_29220,plain,
! [X0: $i,X1: $i] : app(cons(X0,nil),skaf82(X1)) = cons(X0,skaf82(X1)),
inference(superposition,[status(thm)],[c_256,c_29215]) ).
tcf(c_29454,plain,
cons(skaf83(sk4),skaf82(sk4)) = sk4,
inference(global_subsumption_just,[status(thm)],[c_29183,c_432,c_251,c_433,c_326,c_482,c_497,c_2377,c_2535,c_8310]) ).
tcf(c_29547,plain,
! [X0: $i,X1: $i] :
( ~ ssList(skaf82(X1))
| ( cons(X0,skaf82(X1)) != sk4 ) ),
inference(superposition,[status(thm)],[c_29220,c_28010]) ).
tcf(c_29559,plain,
~ ssList(skaf82(sk4)),
inference(superposition,[status(thm)],[c_29454,c_29547]) ).
tcf(c_30149,plain,
$false,
inference(superposition,[status(thm)],[c_256,c_29559]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC309-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.42 % Computer : n020.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Thu Sep 24 17:33:52 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.48 Running first-order theorem proving
% 0.15/0.48 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.22/0.50
% 0.22/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.22/0.50
% 0.22/0.50 % Detected problem language: tptp
% 0.22/0.52 % Proving...
% 14.60/6.02 % SZS status Started for theBenchmark.p
% 14.60/6.02 % SZS status Unsatisfiable for theBenchmark.p
% 14.60/6.02
% 14.60/6.02 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 14.60/6.02
% 14.60/6.02 % ------ iProver source info
% 14.60/6.02
% 14.60/6.02 % git: date: 2026-07-19 20:42:38 +0200
% 14.60/6.02 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 14.60/6.02 % git: non_committed_changes: false
% 14.60/6.02
% 14.60/6.02 % ------ Parsing...% successful
% 14.60/6.02
% 14.60/6.02
% 14.60/6.02 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 14.60/6.02
% 14.60/6.02 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e sup_sim: 0 sf_s rm: 1 0s sf_e %
% 14.60/6.02
% 14.60/6.02 % ------ Preprocessing...%
% 14.60/6.02
% 14.60/6.02 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.60/6.02 % ------ Proving...
% 14.60/6.02 % ------ Problem Properties
% 14.60/6.02
% 14.60/6.02 %
% 14.60/6.02 % clauses 184
% 14.60/6.02 % conjectures 17
% 14.60/6.02 % EPR 58
% 14.60/6.02 % Horn 154
% 14.60/6.02 % unary 61
% 14.60/6.02 % binary 22
% 14.60/6.02 % lits 559
% 14.60/6.02 % lits eq 74
% 14.60/6.02 % fd_pure 0
% 14.60/6.02 % fd_pseudo 0
% 14.60/6.02 % fd_cond 15
% 14.60/6.02 % fd_pseudo_cond 16
% 14.60/6.02 % AC symbols 0
% 14.60/6.02
% 14.60/6.02 % ------ Input Options Time Limit: Unbounded
% 14.60/6.02
% 14.60/6.02
% 14.60/6.02 % ------
% 14.60/6.02 % Current options:
% 14.60/6.02 % ------
% 14.60/6.02
% 14.60/6.02
% 14.60/6.02 %
% 14.60/6.02
% 14.60/6.02 % ------ Proving...
% 14.60/6.02 %
% 14.60/6.02
% 14.60/6.02 % SZS status Unsatisfiable for theBenchmark.p
% 14.60/6.02
% 14.60/6.02 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.60/6.03
% 14.60/6.03
%------------------------------------------------------------------------------