%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC264-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 : 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:04 PM UTC 2026
% Result : Unsatisfiable 10.50s 2.28s
% Output : CNFRefutation 10.50s
% 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/sandbox/benchmark/Axioms/SWC001-0.ax',clause27) ).
fof(f28,axiom,
! [X0] : ssList(skaf67(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause28) ).
fof(f29,axiom,
! [X0] : ssList(skaf66(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause29) ).
fof(f30,axiom,
! [X0] : ssItem(skaf65(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause30) ).
fof(f31,axiom,
! [X0] : ssItem(skaf64(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause31) ).
fof(f91,axiom,
! [X0] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ leq(skaf64(X0),skaf65(X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause91) ).
fof(f106,axiom,
! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f210,plain,
~ totalorderedP(sk3),
inference(definition_unfolding,[],[f207,f205]) ).
fof(f230,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_268,plain,
! [X0: $i] : ssList(skaf68(X0)),
inference(cnf_transformation,[],[f27]) ).
tcf(c_269,plain,
! [X0: $i] : ssList(skaf67(X0)),
inference(cnf_transformation,[],[f28]) ).
tcf(c_270,plain,
! [X0: $i] : ssList(skaf66(X0)),
inference(cnf_transformation,[],[f29]) ).
tcf(c_271,plain,
! [X0: $i] : ssItem(skaf65(X0)),
inference(cnf_transformation,[],[f30]) ).
tcf(c_272,plain,
! [X0: $i] : ssItem(skaf64(X0)),
inference(cnf_transformation,[],[f31]) ).
tcf(c_332,plain,
! [X0: $i] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ leq(skaf64(X0),skaf65(X0)) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_405,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_422,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,[],[f230]) ).
tcf(c_429,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_431,negated_conjecture,
strictorderedP(sk3),
inference(cnf_transformation,[],[f206]) ).
tcf(c_432,negated_conjecture,
~ totalorderedP(sk3),
inference(cnf_transformation,[],[f210]) ).
tcf(c_6416,negated_conjecture,
~ totalorderedP(sk3),
inference(demodulation,[status(thm)],[c_432]) ).
tcf(c_6417,negated_conjecture,
strictorderedP(sk3),
inference(demodulation,[status(thm)],[c_431]) ).
tcf(c_6419,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_429]) ).
tcf(c_9896,plain,
( totalorderedP(sk3)
| ~ ssList(sk3)
| ~ leq(skaf64(sk3),skaf65(sk3)) ),
inference(instantiation,[status(thm)],[c_332]) ).
tcf(c_17209,plain,
( totalorderedP(sk3)
| ( app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3 ) ),
inference(superposition,[status(thm)],[c_6419,c_405]) ).
tcf(c_17244,plain,
app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3,
inference(forward_subsumption_resolution,[status(thm)],[c_17209,c_6416]) ).
tcf(c_22582,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_17244,c_422]) ).
tcf(c_22635,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_22582,c_17244]) ).
tcf(c_22636,plain,
lt(skaf64(sk3),skaf65(sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_22635,c_6417,c_6419,c_272,c_271,c_270,c_269,c_268]) ).
tcf(c_22850,plain,
( leq(skaf64(sk3),skaf65(sk3))
| ~ ssItem(skaf64(sk3))
| ~ ssItem(skaf65(sk3)) ),
inference(superposition,[status(thm)],[c_22636,c_344]) ).
tcf(c_22851,plain,
leq(skaf64(sk3),skaf65(sk3)),
inference(forward_subsumption_resolution,[status(thm)],[c_22850,c_272,c_271]) ).
tcf(c_22858,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_22851,c_9896,c_432,c_429]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC264-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 17:18:13 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.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...
% 10.50/2.28 % SZS status Started for theBenchmark.p
% 10.50/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 10.50/2.28
% 10.50/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 10.50/2.28
% 10.50/2.28 % ------ iProver source info
% 10.50/2.28
% 10.50/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 10.50/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 10.50/2.28 % git: non_committed_changes: false
% 10.50/2.28
% 10.50/2.28 % ------ Parsing...% successful
% 10.50/2.28
% 10.50/2.28
% 10.50/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 10.50/2.28
% 10.50/2.28 % ------ 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 %
% 10.50/2.28
% 10.50/2.28 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 10.50/2.28
% 10.50/2.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.50/2.28 % ------ Proving...
% 10.50/2.28 % ------ Problem Properties
% 10.50/2.28
% 10.50/2.28 %
% 10.50/2.28 % clauses 181
% 10.50/2.28 % conjectures 4
% 10.50/2.28 % EPR 56
% 10.50/2.28 % Horn 153
% 10.50/2.28 % unary 62
% 10.50/2.28 % binary 21
% 10.50/2.28 % lits 545
% 10.50/2.28 % lits eq 69
% 10.50/2.28 % fd_pure 0
% 10.50/2.28 % fd_pseudo 0
% 10.50/2.28 % fd_cond 15
% 10.50/2.28 % fd_pseudo_cond 14
% 10.50/2.28 % AC symbols 0
% 10.50/2.28
% 10.50/2.28 % ------ Schedule dynamic 5 is on
% 10.50/2.28
% 10.50/2.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.50/2.28
% 10.50/2.28
% 10.50/2.28 % ------
% 10.50/2.28 % Current options:
% 10.50/2.28 % ------
% 10.50/2.28
% 10.50/2.28
% 10.50/2.28 %
% 10.50/2.28
% 10.50/2.28 % ------ Proving...
% 10.50/2.28 %
% 10.50/2.28
% 10.50/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 10.50/2.28
% 10.50/2.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.50/2.28
% 10.50/2.28
%------------------------------------------------------------------------------