%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC032-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 : n012.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:36 PM UTC 2026
% Result : Unsatisfiable 1.85s 0.96s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 25 unt; 1 def)
% Number of atoms : 97 ( 41 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 75 ( 39 ~; 36 |; 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; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f82,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f154,axiom,
! [X2,X0,X1] :
( rearsegP(X2,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f213,negated_conjecture,
( nil = sk1
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f216,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f219,plain,
( nil = sk3
| nil = sk4 ),
inference(definition_unfolding,[],[f213,f204,f205]) ).
fof(f222,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f216,f205,f204]) ).
fof(f233,plain,
! [X0,X1] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f154]) ).
tcf(c_321,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_330,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_333,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_391,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_436,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_438,negated_conjecture,
ssList(sk5),
inference(cnf_transformation,[],[f206]) ).
tcf(c_439,negated_conjecture,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[],[f208]) ).
tcf(c_442,negated_conjecture,
( ( sk4 = nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_443,negated_conjecture,
( ( sk4 = nil )
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_444,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_558,negated_conjecture,
sk4 = nil,
inference(global_subsumption_just,[status(thm)],[c_443,c_443,c_442]) ).
tcf(c_560,negated_conjecture,
sk4 = nil,
inference(global_subsumption_just,[status(thm)],[c_442,c_558]) ).
tcf(c_564,negated_conjecture,
sk3 != nil,
inference(global_subsumption_just,[status(thm)],[c_444,c_443,c_442,c_444]) ).
tcf(c_808,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_391,c_333]) ).
tcf(c_1731,plain,
app(sk3,sk5) = nil,
inference(light_normalisation,[status(thm)],[c_439,c_560]) ).
tcf(c_6502,definition,
iPr_def_12 = app(sk3,sk5),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_6503,plain,
iPr_def_12 = nil,
inference(demodulation,[status(thm)],[c_1731,c_6502]) ).
tcf(c_6504,negated_conjecture,
sk3 != nil,
inference(demodulation,[status(thm)],[c_564]) ).
tcf(c_6508,negated_conjecture,
ssList(sk5),
inference(demodulation,[status(thm)],[c_438]) ).
tcf(c_6509,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_436]) ).
tcf(c_9031,plain,
sk3 != iPr_def_12,
inference(light_normalisation,[status(thm)],[c_6504,c_6503]) ).
tcf(c_9102,plain,
! [X0: $i] :
( ( app(X0,iPr_def_12) = X0 )
| ~ ssList(X0) ),
inference(light_normalisation,[status(thm)],[c_321,c_6503]) ).
tcf(c_9109,plain,
app(sk3,iPr_def_12) = sk3,
inference(superposition,[status(thm)],[c_6509,c_9102]) ).
tcf(c_9571,plain,
! [X0: $i] :
( ( X0 = iPr_def_12 )
| ~ ssList(X0)
| ~ rearsegP(iPr_def_12,X0) ),
inference(light_normalisation,[status(thm)],[c_330,c_6503]) ).
tcf(c_9720,plain,
( rearsegP(iPr_def_12,sk5)
| ~ ssList(sk5)
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_6502,c_808]) ).
tcf(c_9783,plain,
rearsegP(iPr_def_12,sk5),
inference(forward_subsumption_resolution,[status(thm)],[c_9720,c_6508,c_6509]) ).
tcf(c_10155,plain,
( ( sk5 = iPr_def_12 )
| ~ ssList(sk5) ),
inference(superposition,[status(thm)],[c_9783,c_9571]) ).
tcf(c_10156,plain,
sk5 = iPr_def_12,
inference(forward_subsumption_resolution,[status(thm)],[c_10155,c_6508]) ).
tcf(c_10163,plain,
app(sk3,iPr_def_12) = iPr_def_12,
inference(demodulation,[status(thm)],[c_6502,c_10156]) ).
tcf(c_10173,plain,
sk3 = iPr_def_12,
inference(demodulation,[status(thm)],[c_9109,c_10163]) ).
tcf(c_10174,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10173,c_9031]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC032-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Thu Sep 24 16:01:24 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.07/0.33
% 0.07/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33
% 0.07/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 1.85/0.96 % SZS status Started for theBenchmark.p
% 1.85/0.96 % SZS status Unsatisfiable for theBenchmark.p
% 1.85/0.96
% 1.85/0.96 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.85/0.96
% 1.85/0.96 % ------ iProver source info
% 1.85/0.96
% 1.85/0.96 % git: date: 2026-07-19 20:42:38 +0200
% 1.85/0.96 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.85/0.96 % git: non_committed_changes: false
% 1.85/0.96
% 1.85/0.96 % ------ Parsing...% successful
% 1.85/0.96
% 1.85/0.96
% 1.85/0.96 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.85/0.96
% 1.85/0.96 % ------ Preprocessing... sup_sim: 3 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.85/0.96
% 1.85/0.96 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.85/0.96
% 1.85/0.96 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.85/0.96 % ------ Proving...
% 1.85/0.96 % ------ Problem Properties
% 1.85/0.96
% 1.85/0.96 %
% 1.85/0.96 % clauses 185
% 1.85/0.96 % conjectures 6
% 1.85/0.96 % EPR 58
% 1.85/0.96 % Horn 157
% 1.85/0.96 % unary 65
% 1.85/0.96 % binary 21
% 1.85/0.96 % lits 555
% 1.85/0.96 % lits eq 75
% 1.85/0.96 % fd_pure 0
% 1.85/0.96 % fd_pseudo 0
% 1.85/0.96 % fd_cond 15
% 1.85/0.96 % fd_pseudo_cond 14
% 1.85/0.96 % AC symbols 0
% 1.85/0.96
% 1.85/0.96 % ------ Schedule dynamic 5 is on
% 1.85/0.96
% 1.85/0.96 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.85/0.96
% 1.85/0.96
% 1.85/0.96 % ------
% 1.85/0.96 % Current options:
% 1.85/0.96 % ------
% 1.85/0.96
% 1.85/0.96
% 1.85/0.96 %
% 1.85/0.96
% 1.85/0.96 % ------ Proving...
% 1.85/0.96 %
% 1.85/0.96
% 1.85/0.96 % SZS status Unsatisfiable for theBenchmark.p
% 1.85/0.96
% 1.85/0.96 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/0.96
% 1.85/0.96
%------------------------------------------------------------------------------