%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC401-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 : n013.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:38 PM UTC 2026
% Result : Unsatisfiable 72.51s 24.52s
% Output : CNFRefutation 72.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 24
% Syntax : Number of formulae : 110 ( 42 unt; 0 def)
% Number of atoms : 285 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 357 ( 182 ~; 175 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 129 ( 0 sgn 129 !; 0 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f48,axiom,
! [X0,X1] : ssList(skaf48(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause48) ).
fof(f49,axiom,
! [X0,X1] : ssList(skaf47(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause49) ).
fof(f51,axiom,
! [X0,X1] : ssList(skaf45(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
fof(f72,axiom,
! [X0,X1] :
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(f143,axiom,
! [X0,X1] :
( app(X1,skaf45(X0,X1)) = X0
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
fof(f151,axiom,
! [X2,X0,X1] :
( memberP(app(X0,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ memberP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).
fof(f152,axiom,
! [X2,X0,X1] :
( memberP(app(X2,X0),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause141) ).
fof(f155,axiom,
! [X2,X0,X1] :
( frontsegP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
fof(f169,axiom,
! [X2,X0,X1] :
( cons(X0,app(X1,X2)) = app(cons(X0,X1),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
fof(f181,axiom,
! [X0,X1] :
( app(app(skaf47(X0,X1),X1),skaf48(X1,X0)) = X0
| ~ ssList(X0)
| ~ ssList(X1)
| ~ segmentP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause168) ).
fof(f188,axiom,
! [X2,X3,X0,X1] :
( frontsegP(X1,X3)
| ~ ssItem(X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ frontsegP(cons(X0,X1),cons(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause174) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
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(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f209,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
memberP(sk3,sk5),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f215,plain,
~ memberP(sk4,sk5),
inference(definition_unfolding,[],[f211,f204]) ).
fof(f227,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f155]) ).
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_253,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_293,plain,
! [X0: $i,X1: $i] : ssList(skaf48(X0,X1)),
inference(cnf_transformation,[],[f48]) ).
tcf(c_294,plain,
! [X0: $i,X1: $i] : ssList(skaf47(X0,X1)),
inference(cnf_transformation,[],[f49]) ).
tcf(c_296,plain,
! [X0: $i,X1: $i] : ssList(skaf45(X0,X1)),
inference(cnf_transformation,[],[f51]) ).
tcf(c_317,plain,
! [X0: $i,X1: $i] :
( duplicatefreeP(X0)
| ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_365,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i] :
( ( app(X1,skaf45(X0,X1)) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_385,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X0,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(cnf_transformation,[],[f151]) ).
tcf(c_386,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X2,X0),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_389,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_402,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( cons(X2,app(X0,X1)) = app(cons(X2,X0),X1) )
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_413,plain,
! [X0: $i,X1: $i] :
( ( app(app(skaf47(X0,X1),X1),skaf48(X1,X0)) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X0,X1) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_419,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( frontsegP(X1,X3)
| ~ ssItem(X2)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ frontsegP(cons(X0,X1),cons(X2,X3)) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_424,plain,
! [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_433,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_434,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_435,negated_conjecture,
segmentP(sk4,sk3),
inference(cnf_transformation,[],[f206]) ).
tcf(c_438,negated_conjecture,
ssItem(sk5),
inference(cnf_transformation,[],[f209]) ).
tcf(c_439,negated_conjecture,
memberP(sk3,sk5),
inference(cnf_transformation,[],[f214]) ).
tcf(c_440,negated_conjecture,
~ memberP(sk4,sk5),
inference(cnf_transformation,[],[f215]) ).
tcf(c_799,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_389,c_330]) ).
tcf(c_6525,plain,
! [X0: $i] :
( ~ iPr_def_10
| ssItem(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_317]) ).
tcf(c_6526,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ ssList(X0)
| duplicatefreeP(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_317]) ).
tcf(c_6527,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_317]) ).
tcf(c_6529,negated_conjecture,
~ memberP(sk4,sk5),
inference(demodulation,[status(thm)],[c_440]) ).
tcf(c_6530,negated_conjecture,
memberP(sk3,sk5),
inference(demodulation,[status(thm)],[c_439]) ).
tcf(c_6531,negated_conjecture,
ssItem(sk5),
inference(demodulation,[status(thm)],[c_438]) ).
tcf(c_6533,negated_conjecture,
segmentP(sk4,sk3),
inference(demodulation,[status(thm)],[c_435]) ).
tcf(c_6534,negated_conjecture,
ssList(sk4),
inference(demodulation,[status(thm)],[c_434]) ).
tcf(c_6535,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_433]) ).
tcf(c_10967,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sk3) = cons(X0,sk3) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_6535,c_365]) ).
tcf(c_11277,plain,
app(cons(sk5,nil),sk3) = cons(sk5,sk3),
inference(superposition,[status(thm)],[c_6531,c_10967]) ).
tcf(c_11337,plain,
( ssList(cons(sk5,sk3))
| ~ ssList(sk3)
| ~ ssList(cons(sk5,nil)) ),
inference(superposition,[status(thm)],[c_11277,c_330]) ).
tcf(c_11341,plain,
( ssList(cons(sk5,sk3))
| ~ ssList(cons(sk5,nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11337,c_6535]) ).
tcf(c_11358,plain,
( ssList(cons(sk5,sk3))
| ~ ssItem(sk5)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_331,c_11341]) ).
tcf(c_11359,plain,
ssList(cons(sk5,sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_11358,c_6531,c_253]) ).
tcf(c_12944,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(sk5)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ duplicatefreeP(app(app(X0,cons(sk5,X1)),cons(sk5,X2)))
| ~ ssList(app(app(X0,cons(sk5,X1)),cons(sk5,X2))) ),
inference(instantiation,[status(thm)],[c_424]) ).
tcf(c_12945,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ~ duplicatefreeP(app(app(nil,cons(sk5,nil)),cons(sk5,nil)))
| ~ ssList(app(app(nil,cons(sk5,nil)),cons(sk5,nil))) ),
inference(instantiation,[status(thm)],[c_12944]) ).
tcf(c_15204,plain,
! [X0: $i,X1: $i] :
( ( cons(X1,app(sk3,X0)) = app(cons(X1,sk3),X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_6535,c_402]) ).
tcf(c_18119,plain,
! [X0: $i,X1: $i,X2: $i] :
( ssList(app(app(X0,cons(sk5,X1)),cons(sk5,X2)))
| ~ ssList(cons(sk5,X2))
| ~ ssList(app(X0,cons(sk5,X1))) ),
inference(instantiation,[status(thm)],[c_330]) ).
tcf(c_18120,plain,
( ssList(app(app(nil,cons(sk5,nil)),cons(sk5,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(nil,cons(sk5,nil))) ),
inference(instantiation,[status(thm)],[c_18119]) ).
tcf(c_20566,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,cons(sk5,X0)))
| ~ ssList(X1)
| ~ ssList(cons(sk5,X0)) ),
inference(instantiation,[status(thm)],[c_330]) ).
tcf(c_20567,plain,
( ssList(app(nil,cons(sk5,nil)))
| ~ ssList(nil)
| ~ ssList(cons(sk5,nil)) ),
inference(instantiation,[status(thm)],[c_20566]) ).
tcf(c_31999,plain,
! [X0: $i] :
( ssList(cons(sk5,X0))
| ~ ssItem(sk5)
| ~ ssList(X0) ),
inference(instantiation,[status(thm)],[c_331]) ).
tcf(c_32000,plain,
( ssList(cons(sk5,nil))
| ~ ssItem(sk5)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_31999]) ).
tcf(c_51501,plain,
! [X0: $i] :
( ( cons(X0,app(sk3,sk3)) = app(cons(X0,sk3),sk3) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_6535,c_15204]) ).
tcf(c_51775,plain,
cons(sk5,app(sk3,sk3)) = app(cons(sk5,sk3),sk3),
inference(superposition,[status(thm)],[c_6531,c_51501]) ).
tcf(c_52043,plain,
( frontsegP(cons(sk5,app(sk3,sk3)),cons(sk5,sk3))
| ~ ssList(sk3)
| ~ ssList(cons(sk5,sk3)) ),
inference(superposition,[status(thm)],[c_51775,c_799]) ).
tcf(c_52063,plain,
frontsegP(cons(sk5,app(sk3,sk3)),cons(sk5,sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_52043,c_6535,c_11359]) ).
tcf(c_52291,plain,
( frontsegP(app(sk3,sk3),sk3)
| ~ ssItem(sk5)
| ~ ssList(sk3)
| ~ ssList(app(sk3,sk3)) ),
inference(superposition,[status(thm)],[c_52063,c_419]) ).
tcf(c_52292,plain,
( frontsegP(app(sk3,sk3),sk3)
| ~ ssList(app(sk3,sk3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_52291,c_6531,c_6535]) ).
tcf(c_52309,plain,
( ( app(sk3,skaf45(app(sk3,sk3),sk3)) = app(sk3,sk3) )
| ~ ssList(sk3)
| ~ ssList(app(sk3,sk3)) ),
inference(superposition,[status(thm)],[c_52292,c_377]) ).
tcf(c_52315,plain,
( ( app(sk3,skaf45(app(sk3,sk3),sk3)) = app(sk3,sk3) )
| ~ ssList(app(sk3,sk3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_52309,c_6535]) ).
tcf(c_58879,plain,
! [X0: $i,X1: $i,X2: $i] :
( duplicatefreeP(app(app(X0,cons(sk5,X1)),cons(sk5,X2)))
| ~ iPr_def_11
| ~ ssList(app(app(X0,cons(sk5,X1)),cons(sk5,X2))) ),
inference(instantiation,[status(thm)],[c_6526]) ).
tcf(c_58880,plain,
( duplicatefreeP(app(app(nil,cons(sk5,nil)),cons(sk5,nil)))
| ~ iPr_def_11
| ~ ssList(app(app(nil,cons(sk5,nil)),cons(sk5,nil))) ),
inference(instantiation,[status(thm)],[c_58879]) ).
tcf(c_62912,plain,
( ( app(sk3,skaf45(app(sk3,sk3),sk3)) = app(sk3,sk3) )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_330,c_52315]) ).
tcf(c_62913,plain,
app(sk3,skaf45(app(sk3,sk3),sk3)) = app(sk3,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_62912,c_6535]) ).
tcf(c_62915,plain,
( ssList(app(sk3,sk3))
| ~ ssList(sk3)
| ~ ssList(skaf45(app(sk3,sk3),sk3)) ),
inference(superposition,[status(thm)],[c_62913,c_330]) ).
tcf(c_62937,plain,
ssList(app(sk3,sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_62915,c_6535,c_296]) ).
tcf(c_63076,plain,
( duplicatefreeP(app(sk3,sk3))
| ~ iPr_def_11 ),
inference(superposition,[status(thm)],[c_62937,c_6526]) ).
tcf(c_63674,plain,
~ iPr_def_11,
inference(global_subsumption_just,[status(thm)],[c_63076,c_438,c_253,c_12945,c_18120,c_20567,c_32000,c_58880]) ).
tcf(c_63676,plain,
iPr_def_10,
inference(backward_subsumption_resolution,[status(thm)],[c_6527,c_63674]) ).
tcf(c_63683,plain,
! [X0: $i] : ssItem(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_6525,c_63676]) ).
tcf(c_63724,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X2,X0),X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_386,c_63683]) ).
tcf(c_63725,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X0,X2),X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_385,c_63683]) ).
tcf(c_267402,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X0,X2),X1)
| ~ memberP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(global_subsumption_just,[status(thm)],[c_385,c_63725]) ).
tcf(c_267403,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X0,X2),X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(renaming,[status(thm)],[c_267402]) ).
tcf(c_267468,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X2,X0),X1)
| ~ memberP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(global_subsumption_just,[status(thm)],[c_386,c_63724]) ).
tcf(c_267469,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X2,X0),X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ),
inference(renaming,[status(thm)],[c_267468]) ).
tcf(c_271463,plain,
( ( app(app(skaf47(sk4,sk3),sk3),skaf48(sk3,sk4)) = sk4 )
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6533,c_413]) ).
tcf(c_271473,plain,
app(app(skaf47(sk4,sk3),sk3),skaf48(sk3,sk4)) = sk4,
inference(forward_subsumption_resolution,[status(thm)],[c_271463,c_6534,c_6535]) ).
tcf(c_271507,plain,
! [X0: $i] :
( memberP(sk4,X0)
| ~ ssList(skaf48(sk3,sk4))
| ~ ssList(app(skaf47(sk4,sk3),sk3))
| ~ memberP(app(skaf47(sk4,sk3),sk3),X0) ),
inference(superposition,[status(thm)],[c_271473,c_267403]) ).
tcf(c_271519,plain,
! [X0: $i] :
( memberP(sk4,X0)
| ~ ssList(app(skaf47(sk4,sk3),sk3))
| ~ memberP(app(skaf47(sk4,sk3),sk3),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_271507,c_293]) ).
tcf(c_272736,plain,
! [X0: $i] :
( memberP(sk4,X0)
| ~ ssList(sk3)
| ~ memberP(sk3,X0)
| ~ ssList(skaf47(sk4,sk3))
| ~ ssList(app(skaf47(sk4,sk3),sk3)) ),
inference(superposition,[status(thm)],[c_267469,c_271519]) ).
tcf(c_272737,plain,
! [X0: $i] :
( memberP(sk4,X0)
| ~ memberP(sk3,X0)
| ~ ssList(app(skaf47(sk4,sk3),sk3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_272736,c_6535,c_294]) ).
tcf(c_276434,plain,
! [X0: $i] :
( memberP(sk4,X0)
| ~ ssList(sk3)
| ~ memberP(sk3,X0)
| ~ ssList(skaf47(sk4,sk3)) ),
inference(superposition,[status(thm)],[c_330,c_272737]) ).
tcf(c_276435,plain,
! [X0: $i] :
( memberP(sk4,X0)
| ~ memberP(sk3,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_276434,c_6535,c_294]) ).
tcf(c_276445,plain,
memberP(sk4,sk5),
inference(superposition,[status(thm)],[c_6530,c_276435]) ).
tcf(c_276447,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_276445,c_6529]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC401-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.09/5.38 % Computer : n013.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Thu Sep 24 18:03:12 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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.14/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.45 % Proving...
% 72.51/24.52 % SZS status Started for theBenchmark.p
% 72.51/24.52 % SZS status Unsatisfiable for theBenchmark.p
% 72.51/24.52
% 72.51/24.52 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 72.51/24.52
% 72.51/24.52 % ------ iProver source info
% 72.51/24.52
% 72.51/24.52 % git: date: 2026-07-19 20:42:38 +0200
% 72.51/24.52 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 72.51/24.52 % git: non_committed_changes: false
% 72.51/24.52
% 72.51/24.52 % ------ Parsing...% successful
% 72.51/24.52
% 72.51/24.52
% 72.51/24.52 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 72.51/24.52
% 72.51/24.52 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 72.51/24.52
% 72.51/24.52 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 72.51/24.52
% 72.51/24.52 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 72.51/24.52 % ------ Proving...
% 72.51/24.52 % ------ Problem Properties
% 72.51/24.52
% 72.51/24.52 %
% 72.51/24.52 % clauses 185
% 72.51/24.52 % conjectures 7
% 72.51/24.52 % EPR 60
% 72.51/24.52 % Horn 157
% 72.51/24.52 % unary 65
% 72.51/24.52 % binary 21
% 72.51/24.52 % lits 553
% 72.51/24.52 % lits eq 70
% 72.51/24.52 % fd_pure 0
% 72.51/24.52 % fd_pseudo 0
% 72.51/24.52 % fd_cond 16
% 72.51/24.52 % fd_pseudo_cond 14
% 72.51/24.52 % AC symbols 0
% 72.51/24.52
% 72.51/24.52 % ------ Schedule dynamic 5 is on
% 72.51/24.52
% 72.51/24.52 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 72.51/24.52
% 72.51/24.52
% 72.51/24.52 % ------
% 72.51/24.52 % Current options:
% 72.51/24.52 % ------
% 72.51/24.52
% 72.51/24.52
% 72.51/24.52 %
% 72.51/24.52
% 72.51/24.52 % ------ Proving...
% 72.51/24.52 % Proof_search_loop: time out after: 6856 full_loop iterations
% 72.51/24.52
% 72.51/24.52 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 72.51/24.52
% 72.51/24.52
% 72.51/24.52 % ------
% 72.51/24.52 % Current options:
% 72.51/24.52 % ------
% 72.51/24.52
% 72.51/24.52
% 72.51/24.52 %
% 72.51/24.52
% 72.51/24.52 % ------ Proving...
% 72.51/24.52 %
% 72.51/24.52
% 72.51/24.52 % SZS status Unsatisfiable for theBenchmark.p
% 72.51/24.52
% 72.51/24.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 72.51/24.52
% 72.51/24.52
%------------------------------------------------------------------------------