%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC274-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 : n017.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:06 PM UTC 2026
% Result : Unsatisfiable 1.37s 1.95s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 39 ( 25 unt; 0 def)
% Number of atoms : 94 ( 6 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 111 ( 56 ~; 55 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 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 : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [X0] : ssList(skaf68(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause27) ).
fof(f28,axiom,
! [X0] : ssList(skaf67(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause28) ).
fof(f29,axiom,
! [X0] : ssList(skaf66(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause29) ).
fof(f30,axiom,
! [X0] : ssItem(skaf65(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause30) ).
fof(f31,axiom,
! [X0] : ssItem(skaf64(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause31) ).
fof(f91,axiom,
! [X0] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ leq(skaf64(X0),skaf65(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause91) ).
fof(f106,axiom,
! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
fof(f177,axiom,
! [X0] :
( app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0
| totalorderedP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause164) ).
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,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f219,plain,
~ totalorderedP(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_274,plain,
! [X0: $i] : ssList(skaf68(X0)),
inference(cnf_transformation,[],[f27]) ).
tcf(c_275,plain,
! [X0: $i] : ssList(skaf67(X0)),
inference(cnf_transformation,[],[f28]) ).
tcf(c_276,plain,
! [X0: $i] : ssList(skaf66(X0)),
inference(cnf_transformation,[],[f29]) ).
tcf(c_277,plain,
! [X0: $i] : ssItem(skaf65(X0)),
inference(cnf_transformation,[],[f30]) ).
tcf(c_278,plain,
! [X0: $i] : ssItem(skaf64(X0)),
inference(cnf_transformation,[],[f31]) ).
tcf(c_338,plain,
! [X0: $i] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ leq(skaf64(X0),skaf65(X0)) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_350,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_411,plain,
! [X0: $i] :
( totalorderedP(X0)
| ( app(app(skaf66(X0),cons(skaf64(X0),skaf67(X0))),cons(skaf65(X0),skaf68(X0))) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
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,
~ totalorderedP(sk3),
inference(cnf_transformation,[],[f219]) ).
tcf(c_6570,negated_conjecture,
~ totalorderedP(sk3),
inference(demodulation,[status(thm)],[c_443]) ).
tcf(c_6574,negated_conjecture,
strictorderedP(sk3),
inference(demodulation,[status(thm)],[c_440]) ).
tcf(c_6579,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_435]) ).
tcf(c_10592,plain,
( totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ),
inference(instantiation,[status(thm)],[c_338]) ).
tcf(c_18586,plain,
( totalorderedP(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ),
inference(superposition,[status(thm)],[c_6579,c_411]) ).
tcf(c_18630,plain,
app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3,
inference(forward_subsumption_resolution,[status(thm)],[c_18586,c_6570]) ).
tcf(c_27984,plain,
( lt(skaf64(sk3),skaf65(sk3))
| ~ ssList(sk3)
| ~ ssItem(skaf64(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssList(skaf68(sk3))
| ~ strictorderedP(app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3)))) ),
inference(superposition,[status(thm)],[c_18630,c_428]) ).
tcf(c_28048,plain,
( lt(skaf64(sk3),skaf65(sk3))
| ~ strictorderedP(sk3)
| ~ ssList(sk3)
| ~ ssItem(skaf64(sk3))
| ~ ssItem(skaf65(sk3))
| ~ ssList(skaf66(sk3))
| ~ ssList(skaf67(sk3))
| ~ ssList(skaf68(sk3)) ),
inference(light_normalisation,[status(thm)],[c_27984,c_18630]) ).
tcf(c_28049,plain,
lt(skaf64(sk3),skaf65(sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_28048,c_6574,c_6579,c_278,c_277,c_276,c_275,c_274]) ).
tcf(c_28249,plain,
( leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssItem(skaf65(sk3)) ),
inference(superposition,[status(thm)],[c_28049,c_350]) ).
tcf(c_28250,plain,
leq(skaf64(sk3),skaf65(sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_28249,c_278,c_277]) ).
tcf(c_28261,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_28250,c_10592,c_443,c_435]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC274-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/0.57 % Computer : n017.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Thu Sep 24 17:17:16 UTC 2026
% 0.09/0.57 % CPUTime :
% 0.09/0.57 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.61 Running first-order theorem proving
% 0.09/0.61 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.09/0.62
% 0.09/0.62 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.62
% 0.09/0.62 % Detected problem language: tptp
% 0.14/0.63 % Proving...
% 1.37/1.95 % SZS status Started for theBenchmark.p
% 1.37/1.95 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.95
% 1.37/1.95 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.37/1.95
% 1.37/1.95 % ------ iProver source info
% 1.37/1.95
% 1.37/1.95 % git: date: 2026-07-19 20:42:38 +0200
% 1.37/1.95 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.37/1.95 % git: non_committed_changes: false
% 1.37/1.95
% 1.37/1.95 % ------ Parsing...% successful
% 1.37/1.95
% 1.37/1.95
% 1.37/1.95 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.37/1.95
% 1.37/1.95 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.37/1.95
% 1.37/1.95 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.37/1.95
% 1.37/1.95 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.37/1.95 % ------ Proving...
% 1.37/1.95 % ------ Problem Properties
% 1.37/1.95
% 1.37/1.95 %
% 1.37/1.95 % clauses 189
% 1.37/1.95 % conjectures 10
% 1.37/1.95 % EPR 60
% 1.37/1.95 % Horn 161
% 1.37/1.95 % unary 67
% 1.37/1.95 % binary 22
% 1.37/1.95 % lits 566
% 1.37/1.95 % lits eq 78
% 1.37/1.95 % fd_pure 0
% 1.37/1.95 % fd_pseudo 0
% 1.37/1.95 % fd_cond 15
% 1.37/1.95 % fd_pseudo_cond 14
% 1.37/1.95 % AC symbols 0
% 1.37/1.95
% 1.37/1.95 % ------ Schedule dynamic 5 is on
% 1.37/1.95
% 1.37/1.95 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.37/1.95
% 1.37/1.95
% 1.37/1.95 % ------
% 1.37/1.95 % Current options:
% 1.37/1.95 % ------
% 1.37/1.95
% 1.37/1.95
% 1.37/1.95 %
% 1.37/1.95
% 1.37/1.95 % ------ Proving...
% 1.37/1.95 %
% 1.37/1.95
% 1.37/1.95 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.95
% 1.37/1.95 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.37/1.95
% 1.37/1.95
%------------------------------------------------------------------------------