%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:16:11 PM UTC 2026
% Result : Unsatisfiable 1.10s 1.27s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 72 ( 36 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X2,X0,X1] :
( q2(X0,X1,X2)
| ~ less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f4,axiom,
! [X2,X0,X1] :
( q3(X0,X1,X2)
| less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f5,axiom,
! [X2,X0,X1] :
( q4(X0,X1,X1)
| ~ q2(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f6,axiom,
! [X2,X0,X1] :
( q4(X0,X1,X0)
| ~ q3(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f7,axiom,
! [X0] : less_or_equalish(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
fof(f10,axiom,
! [X0,X1] :
( less_or_equalish(X1,X0)
| less_or_equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_less_or_equal) ).
fof(f12,negated_conjecture,
q1(a,b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
fof(f13,negated_conjecture,
! [X0] :
( ~ less_or_equalish(X0,a)
| ~ less_or_equalish(b,X0)
| ~ less_or_equalish(a,X0)
| ~ q4(a,b,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f14,negated_conjecture,
! [X0] :
( ~ less_or_equalish(X0,b)
| ~ less_or_equalish(b,X0)
| ~ less_or_equalish(a,X0)
| ~ q4(a,b,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( q2(X0,X1,X2)
| ~ less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equalish(X0,X1)
| q3(X0,X1,X2)
| ~ q1(X0,X1,X2) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] :
( q4(X0,X1,X1)
| ~ q2(X0,X1,X2) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] :
( q4(X0,X1,X0)
| ~ q3(X0,X1,X2) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_69,plain,
! [X0: $i] : less_or_equalish(X0,X0),
inference(cnf_transformation,[],[f7]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( less_or_equalish(X1,X0)
| less_or_equalish(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_74,negated_conjecture,
q1(a,b,c),
inference(cnf_transformation,[],[f12]) ).
tcf(c_75,negated_conjecture,
! [X0: $i] :
( ~ less_or_equalish(b,X0)
| ~ less_or_equalish(a,X0)
| ~ less_or_equalish(X0,a)
| ~ q4(a,b,X0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_76,negated_conjecture,
! [X0: $i] :
( ~ less_or_equalish(b,X0)
| ~ less_or_equalish(a,X0)
| ~ less_or_equalish(X0,b)
| ~ q4(a,b,X0) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_77,plain,
less_or_equalish(a,a),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_156,plain,
! [X0: $i,X1: $i,X2: $i] :
( q4(X0,X1,X1)
| ~ less_or_equalish(X0,X1)
| ~ q1(X0,X1,X2) ),
inference(resolution,[status(thm)],[c_65,c_67]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_or_equalish(X0,X1)
| q4(X0,X1,X0)
| ~ q1(X0,X1,X2) ),
inference(resolution,[status(thm)],[c_66,c_68]) ).
tcf(c_183,plain,
( less_or_equalish(a,b)
| q4(a,b,a) ),
inference(resolution,[status(thm)],[c_170,c_74]) ).
tcf(c_190,plain,
( q4(a,b,b)
| ~ less_or_equalish(a,b) ),
inference(resolution,[status(thm)],[c_156,c_74]) ).
tcf(c_205,plain,
( less_or_equalish(a,b)
| ~ less_or_equalish(b,a)
| ~ less_or_equalish(a,a) ),
inference(resolution,[status(thm)],[c_75,c_183]) ).
tcf(c_206,plain,
( less_or_equalish(a,b)
| ~ less_or_equalish(b,a) ),
inference(global_subsumption_just,[status(thm)],[c_205,c_77,c_205]) ).
tcf(c_212,plain,
less_or_equalish(a,b),
inference(forward_subsumption_resolution,[status(thm)],[c_206,c_72]) ).
tcf(c_214,plain,
( ~ less_or_equalish(b,b)
| ~ less_or_equalish(a,b) ),
inference(resolution,[status(thm)],[c_76,c_190]) ).
tcf(c_215,plain,
~ less_or_equalish(b,b),
inference(global_subsumption_just,[status(thm)],[c_214,c_212,c_214]) ).
tcf(c_219,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_215,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n017.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 18:11:32 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.44 Running EPR theorem proving
% 0.10/0.44 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.45
% 0.10/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.45
% 0.10/0.46 % Detected problem language: tptp
% 0.19/0.47 % Proving...
% 1.10/1.27 % SZS status Started for theBenchmark.p
% 1.10/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.10/1.27
% 1.10/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.10/1.27
% 1.10/1.27 % ------ iProver source info
% 1.10/1.27
% 1.10/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.10/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.10/1.27 % git: non_committed_changes: false
% 1.10/1.27
% 1.10/1.27 % ------ Parsing...% successful
% 1.10/1.27
% 1.10/1.27
% 1.10/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 1.10/1.27 %
% 1.10/1.27
% 1.10/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s%
% 1.10/1.27
% 1.10/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.10/1.27
% 1.10/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.10/1.28
% 1.10/1.28
%------------------------------------------------------------------------------