%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC181-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 : n015.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:17 PM UTC 2026
% Result : Unsatisfiable 65.38s 9.92s
% Output : CNFRefutation 65.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 22 unt; 0 def)
% Number of atoms : 122 ( 16 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 154 ( 79 ~; 75 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 72 !; 0 ?; 54 :)
% Comments :
%------------------------------------------------------------------------------
fof(f18,axiom,
! [X0] : ssList(skaf77(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause18) ).
fof(f19,axiom,
! [X0] : ssList(skaf76(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause19) ).
fof(f20,axiom,
! [X0] : ssList(skaf75(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause20) ).
fof(f63,axiom,
! [X0] :
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
fof(f72,axiom,
! [X0,X1] :
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f175,axiom,
! [X0] :
( app(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),cons(skaf74(X0),skaf77(X0))) = X0
| duplicatefreeP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause162) ).
fof(f195,axiom,
! [X2,X3,X0,X1,X4,X5] :
( lt(X1,X3)
| ~ ssList(X5)
| ~ strictorderedP(X5)
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4)
| app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f210,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f215,negated_conjecture,
~ duplicatefreeP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f219,plain,
~ duplicatefreeP(sk3),
inference(definition_unfolding,[],[f215,f205]) ).
fof(f239,plain,
! [X2,X3,X0,X1,X4] :
( lt(X1,X3)
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(equality_resolution,[],[f195]) ).
tcf(c_265,plain,
! [X0: $i] : ssList(skaf77(X0)),
inference(cnf_transformation,[],[f18]) ).
tcf(c_266,plain,
! [X0: $i] : ssList(skaf76(X0)),
inference(cnf_transformation,[],[f19]) ).
tcf(c_267,plain,
! [X0: $i] : ssList(skaf75(X0)),
inference(cnf_transformation,[],[f20]) ).
tcf(c_310,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i] :
( duplicatefreeP(X0)
| ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_409,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ( app(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),cons(skaf74(X0),skaf77(X0))) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_428,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(cnf_transformation,[],[f239]) ).
tcf(c_435,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_440,negated_conjecture,
strictorderedP(sk3),
inference(cnf_transformation,[],[f210]) ).
tcf(c_443,negated_conjecture,
~ duplicatefreeP(sk3),
inference(cnf_transformation,[],[f219]) ).
tcf(c_3007,plain,
! [X0: $i] :
( ( app(app(skaf75(X0),cons(skaf74(X0),skaf76(X0))),cons(skaf74(X0),skaf77(X0))) = X0 )
| ~ ssList(X0)
| ( X0 != sk3 ) ),
inference(resolution_lifted,[status(thm)],[c_409,c_443]) ).
tcf(c_3008,plain,
( ( app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))) = sk3 )
| ~ ssList(sk3) ),
inference(unflattening,[status(thm)],[c_3007]) ).
tcf(c_3014,plain,
! [X0: $i,X1: $i] :
( ssItem(X1)
| ~ ssList(X0)
| ( X0 != sk3 ) ),
inference(resolution_lifted,[status(thm)],[c_319,c_443]) ).
tcf(c_3015,plain,
! [X0: $i] :
( ssItem(X0)
| ~ ssList(sk3) ),
inference(unflattening,[status(thm)],[c_3014]) ).
tcf(c_3017,plain,
! [X0: $i] : ssItem(X0),
inference(global_subsumption_just,[status(thm)],[c_3015,c_435,c_3015]) ).
tcf(c_3060,plain,
! [X0: $i] : ~ lt(X0,X0),
inference(backward_subsumption_resolution,[status(thm)],[c_310,c_3017]) ).
tcf(c_3084,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_428,c_3017]) ).
tcf(c_3895,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(backward_subsumption_resolution,[status(thm)],[c_3084,c_3017]) ).
tcf(c_8468,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(demodulation,[status(thm)],[c_3895]) ).
tcf(c_8509,plain,
! [X0: $i] : ~ lt(X0,X0),
inference(demodulation,[status(thm)],[c_3060]) ).
tcf(c_8530,plain,
! [X0: $i,X1: $i] :
( ssList(X0)
| ~ ssList(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_8532,plain,
! [X0: $i,X1: $i] :
( strictorderedP(X0)
| ~ strictorderedP(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_11667,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(app(X0,cons(X1,X2)))
| ~ ssList(X3)
| ( app(X0,cons(X1,X2)) != X3 ) ),
inference(instantiation,[status(thm)],[c_8530]) ).
tcf(c_15145,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X4)
| ( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ) ),
inference(instantiation,[status(thm)],[c_11667]) ).
tcf(c_27428,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(X5)
| ( app(app(X0,cons(X1,X2)),cons(X3,X4)) != X5 ) ),
inference(instantiation,[status(thm)],[c_8532]) ).
tcf(c_33989,plain,
( strictorderedP(app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))))
| ~ strictorderedP(sk3)
| ( app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))) != sk3 ) ),
inference(instantiation,[status(thm)],[c_27428]) ).
tcf(c_47455,plain,
( lt(skaf74(sk3),skaf74(sk3))
| ~ ssList(skaf75(sk3))
| ~ ssList(skaf76(sk3))
| ~ ssList(skaf77(sk3))
| ~ strictorderedP(app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))))
| ~ ssList(app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3)))) ),
inference(instantiation,[status(thm)],[c_8468]) ).
tcf(c_63351,plain,
ssList(skaf77(sk3)),
inference(instantiation,[status(thm)],[c_265]) ).
tcf(c_82286,plain,
ssList(skaf76(sk3)),
inference(instantiation,[status(thm)],[c_266]) ).
tcf(c_83596,plain,
! [X0: $i] :
( ssList(app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))))
| ~ ssList(X0)
| ( app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))) != X0 ) ),
inference(instantiation,[status(thm)],[c_15145]) ).
tcf(c_97299,plain,
ssList(skaf75(sk3)),
inference(instantiation,[status(thm)],[c_267]) ).
tcf(c_118888,plain,
( ssList(app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))))
| ~ ssList(sk3)
| ( app(app(skaf75(sk3),cons(skaf74(sk3),skaf76(sk3))),cons(skaf74(sk3),skaf77(sk3))) != sk3 ) ),
inference(instantiation,[status(thm)],[c_83596]) ).
tcf(c_127460,plain,
~ lt(skaf74(sk3),skaf74(sk3)),
inference(instantiation,[status(thm)],[c_8509]) ).
tcf(c_127461,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_127460,c_118888,c_97299,c_82286,c_63351,c_47455,c_33989,c_3008,c_435,c_440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC181-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.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 16:53:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 65.38/9.92 % SZS status Started for theBenchmark.p
% 65.38/9.92 % SZS status Unsatisfiable for theBenchmark.p
% 65.38/9.92
% 65.38/9.92 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 65.38/9.92
% 65.38/9.92 % ------ iProver source info
% 65.38/9.92
% 65.38/9.92 % git: date: 2026-07-19 20:42:38 +0200
% 65.38/9.92 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 65.38/9.92 % git: non_committed_changes: false
% 65.38/9.92
% 65.38/9.92 % ------ Parsing...% successful
% 65.38/9.92
% 65.38/9.92
% 65.38/9.92 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 65.38/9.92
% 65.38/9.92 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 65.38/9.92
% 65.38/9.92 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 65.38/9.92
% 65.38/9.92 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 65.38/9.92 % ------ Proving...
% 65.38/9.92 % ------ Problem Properties
% 65.38/9.92
% 65.38/9.92 %
% 65.38/9.92 % clauses 167
% 65.38/9.92 % conjectures 7
% 65.38/9.92 % EPR 54
% 65.38/9.92 % Horn 141
% 65.38/9.92 % unary 61
% 65.38/9.92 % binary 24
% 65.38/9.92 % lits 440
% 65.38/9.92 % lits eq 77
% 65.38/9.92 % fd_pure 0
% 65.38/9.92 % fd_pseudo 0
% 65.38/9.92 % fd_cond 14
% 65.38/9.92 % fd_pseudo_cond 14
% 65.38/9.92 % AC symbols 0
% 65.38/9.92
% 65.38/9.92 % ------ Schedule dynamic 5 is on
% 65.38/9.92
% 65.38/9.92 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 65.38/9.92
% 65.38/9.92
% 65.38/9.92 % ------
% 65.38/9.92 % Current options:
% 65.38/9.92 % ------
% 65.38/9.92
% 65.38/9.92
% 65.38/9.92 %
% 65.38/9.92
% 65.38/9.92 % ------ Proving...
% 65.38/9.92 %
% 65.38/9.92
% 65.38/9.92 % SZS status Unsatisfiable for theBenchmark.p
% 65.38/9.92
% 65.38/9.92 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 65.38/9.92
% 65.38/9.92
%------------------------------------------------------------------------------