%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC049-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 : n006.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:40 PM UTC 2026
% Result : Unsatisfiable 3.33s 1.36s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 98 ( 23 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 115 ( 60 ~; 55 |; 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
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(f154,axiom,
! [X2,X0,X1] :
( rearsegP(X2,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause143) ).
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,
! [X0] :
( ~ rearsegP(sk1,X0)
| ~ rearsegP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f213,plain,
! [X0] :
( ~ rearsegP(sk3,X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f214,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
fof(f217,plain,
! [X0,X1] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f154]) ).
tcf(c_247,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_248,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_249,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_250,negated_conjecture,
( ( sk3 = nil )
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_251,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_252,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_253,negated_conjecture,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_257,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_259,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_261,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_269,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_273,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_287,negated_conjecture,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_250,c_250,c_251]) ).
tcf(c_291,negated_conjecture,
sk4 != nil,
inference(global_subsumption_just,[status(thm)],[c_251,c_287]) ).
tcf(c_339,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_261,c_273]) ).
tcf(c_1295,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_247,c_257]) ).
tcf(c_1342,plain,
( rearsegP(sk3,sk3)
| ~ ssList(nil)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_1295,c_339]) ).
tcf(c_1349,plain,
rearsegP(sk3,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_1342,c_259,c_247]) ).
tcf(c_1382,plain,
( rearsegP(sk4,sk3)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_269,c_253]) ).
tcf(c_1383,plain,
( neq(sk3,nil)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_269,c_252]) ).
tcf(c_1385,plain,
neq(sk3,nil),
inference(forward_subsumption_resolution,[status(thm)],[c_1383,c_291,c_259,c_248]) ).
tcf(c_1386,plain,
rearsegP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_1382,c_291,c_259,c_248]) ).
tcf(c_1441,plain,
( ~ ssList(sk3)
| ~ rearsegP(sk4,sk3)
| ~ rearsegP(sk3,sk3) ),
inference(superposition,[status(thm)],[c_1385,c_249]) ).
tcf(c_1442,plain,
~ rearsegP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_1441,c_247,c_1349]) ).
tcf(c_1443,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1442,c_1386]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC049-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.41 % Computer : n006.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Thu Sep 24 16:05:56 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.47 Running first-order theorem proving
% 0.15/0.47 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.15/0.48
% 0.15/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.48
% 0.15/0.48 % Detected problem language: tptp
% 0.15/0.50 % Proving...
% 3.33/1.36 % SZS status Started for theBenchmark.p
% 3.33/1.36 % SZS status Unsatisfiable for theBenchmark.p
% 3.33/1.36
% 3.33/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.33/1.36
% 3.33/1.36 % ------ iProver source info
% 3.33/1.36
% 3.33/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 3.33/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.33/1.36 % git: non_committed_changes: false
% 3.33/1.36
% 3.33/1.36 % ------ Parsing...% successful
% 3.33/1.36
% 3.33/1.36
% 3.33/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.33/1.36
% 3.33/1.36 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.33/1.36
% 3.33/1.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.33/1.36
% 3.33/1.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.33/1.36 % ------ Proving...
% 3.33/1.36 % ------ Problem Properties
% 3.33/1.36
% 3.33/1.36 %
% 3.33/1.36 % clauses 26
% 3.33/1.36 % conjectures 6
% 3.33/1.36 % EPR 15
% 3.33/1.36 % Horn 25
% 3.33/1.36 % unary 6
% 3.33/1.36 % binary 7
% 3.33/1.36 % lits 75
% 3.33/1.36 % lits eq 16
% 3.33/1.36 % fd_pure 0
% 3.33/1.36 % fd_pseudo 0
% 3.33/1.36 % fd_cond 3
% 3.33/1.36 % fd_pseudo_cond 4
% 3.33/1.36 % AC symbols 0
% 3.33/1.36
% 3.33/1.36 % ------ Schedule dynamic 5 is on
% 3.33/1.36
% 3.33/1.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.33/1.36
% 3.33/1.36
% 3.33/1.36 % ------
% 3.33/1.36 % Current options:
% 3.33/1.36 % ------
% 3.33/1.36
% 3.33/1.36
% 3.33/1.36 %
% 3.33/1.36
% 3.33/1.36 % ------ Proving...
% 3.33/1.36 %
% 3.33/1.36
% 3.33/1.36 % SZS status Unsatisfiable for theBenchmark.p
% 3.33/1.36
% 3.33/1.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.33/1.37
% 3.33/1.37
%------------------------------------------------------------------------------