%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC101-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 : n008.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:07:54 PM UTC 2026
% Result : Unsatisfiable 1.22s 1.29s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 43 ( 20 unt; 1 def)
% Number of atoms : 94 ( 31 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 53 ~; 46 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
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(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
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,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
sk4 = app(sk3,sk5),
inference(reorient_equations,[],[f207]) ).
fof(f212,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f213,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,negated_conjecture,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f217,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f213,f204,f205]) ).
fof(f218,plain,
( ~ frontsegP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(definition_unfolding,[],[f214,f205,f204,f205]) ).
fof(f230,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f155]) ).
tcf(c_254,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_346,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_390,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_434,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_436,negated_conjecture,
ssList(sk5),
inference(cnf_transformation,[],[f206]) ).
tcf(c_437,negated_conjecture,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[],[f208]) ).
tcf(c_440,negated_conjecture,
( ( sk4 = nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_441,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_442,negated_conjecture,
( ~ frontsegP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_557,negated_conjecture,
sk3 != nil,
inference(global_subsumption_just,[status(thm)],[c_440,c_440,c_441]) ).
tcf(c_561,negated_conjecture,
sk3 != nil,
inference(global_subsumption_just,[status(thm)],[c_441,c_557]) ).
tcf(c_807,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_390,c_331]) ).
tcf(c_2764,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(sk4,sk3)
| ( X1 != sk3 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_346,c_442]) ).
tcf(c_2765,plain,
( ( nil = sk3 )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ frontsegP(sk4,sk3) ),
inference(unflattening,[status(thm)],[c_2764]) ).
tcf(c_2766,plain,
( ( nil = sk3 )
| ~ frontsegP(sk4,sk3) ),
inference(global_subsumption_just,[status(thm)],[c_2765,c_434,c_254,c_2765]) ).
tcf(c_6581,definition,
iPr_def_12 = app(sk3,sk5),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6582,plain,
( ( nil = sk3 )
| ~ frontsegP(sk4,sk3) ),
inference(demodulation,[status(thm)],[c_2766]) ).
tcf(c_6583,negated_conjecture,
sk3 != nil,
inference(demodulation,[status(thm)],[c_561]) ).
tcf(c_6586,negated_conjecture,
iPr_def_12 = sk4,
inference(demodulation,[status(thm)],[c_437,c_6581]) ).
tcf(c_6587,negated_conjecture,
ssList(sk5),
inference(demodulation,[status(thm)],[c_436]) ).
tcf(c_6589,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_434]) ).
tcf(c_9116,plain,
( ( sk3 = nil )
| ~ frontsegP(iPr_def_12,sk3) ),
inference(light_normalisation,[status(thm)],[c_6582,c_6586]) ).
tcf(c_9117,plain,
~ frontsegP(iPr_def_12,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_9116,c_6583]) ).
tcf(c_9128,plain,
( frontsegP(iPr_def_12,sk3)
| ~ ssList(sk5)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6581,c_807]) ).
tcf(c_9130,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9128,c_9117,c_6587,c_6589]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC101-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.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 16:24:09 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.22/1.29 % SZS status Started for theBenchmark.p
% 1.22/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.22/1.29
% 1.22/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.22/1.29
% 1.22/1.29 % ------ iProver source info
% 1.22/1.29
% 1.22/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.22/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.22/1.29 % git: non_committed_changes: false
% 1.22/1.29
% 1.22/1.29 % ------ Parsing...% successful
% 1.22/1.29
% 1.22/1.29
% 1.22/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.22/1.29
% 1.22/1.29 % ------ 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 %
% 1.22/1.29
% 1.22/1.29 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.22/1.29
% 1.22/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.22/1.29 % ------ Proving...
% 1.22/1.29 % ------ Problem Properties
% 1.22/1.29
% 1.22/1.29 %
% 1.22/1.29 % clauses 186
% 1.22/1.29 % conjectures 7
% 1.22/1.29 % EPR 59
% 1.22/1.29 % Horn 158
% 1.22/1.29 % unary 65
% 1.22/1.29 % binary 22
% 1.22/1.29 % lits 555
% 1.22/1.29 % lits eq 75
% 1.22/1.29 % fd_pure 0
% 1.22/1.29 % fd_pseudo 0
% 1.22/1.29 % fd_cond 15
% 1.22/1.29 % fd_pseudo_cond 14
% 1.22/1.29 % AC symbols 0
% 1.22/1.29
% 1.22/1.29 % ------ Schedule dynamic 5 is on
% 1.22/1.29
% 1.22/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.22/1.29
% 1.22/1.29
% 1.22/1.29 % ------
% 1.22/1.29 % Current options:
% 1.22/1.29 % ------
% 1.22/1.29
% 1.22/1.29
% 1.22/1.29 %
% 1.22/1.29
% 1.22/1.29 % ------ Proving...
% 1.22/1.29 %
% 1.22/1.29
% 1.22/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.22/1.29
% 1.22/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.22/1.29
% 1.22/1.29
%------------------------------------------------------------------------------