%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SWV086+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : Wed Oct 7 10:54:47 AM UTC 2026
% Result : Theorem 0.96s 0.45s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 116 ( 30 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 148 ( 34 ~; 20 |; 0 &; 88 @)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 38 ( 35 usr; 15 con; 0-4 aty)
% Number of variables : 30 ( 0 ^; 30 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a_select2,type,
a_select2: $i > $i > $i ).
thf(tp_a_select3,type,
a_select3: $i > $i > $i > $i ).
thf(tp_def,type,
def: $i ).
thf(tp_dim,type,
dim: $i > $i > $i ).
thf(tp_geq,type,
geq: $i > $i > $o ).
thf(tp_gt,type,
gt: $i > $i > $o ).
thf(tp_inv,type,
inv: $i > $i ).
thf(tp_leq,type,
leq: $i > $i > $o ).
thf(tp_lt,type,
lt: $i > $i > $o ).
thf(tp_minus,type,
minus: $i > $i > $i ).
thf(tp_n0,type,
n0: $i ).
thf(tp_n1,type,
n1: $i ).
thf(tp_n2,type,
n2: $i ).
thf(tp_n3,type,
n3: $i ).
thf(tp_n4,type,
n4: $i ).
thf(tp_n5,type,
n5: $i ).
thf(tp_plus,type,
plus: $i > $i > $i ).
thf(tp_pred,type,
pred: $i > $i ).
thf(tp_pv65,type,
pv65: $i ).
thf(tp_succ,type,
succ: $i > $i ).
thf(tp_sum,type,
sum: $i > $i > $i > $i ).
thf(tp_tptp_const_array1,type,
tptp_const_array1: $i > $i > $i ).
thf(tp_tptp_const_array2,type,
tptp_const_array2: $i > $i > $i > $i ).
thf(tp_tptp_float_0_0,type,
tptp_float_0_0: $i ).
thf(tp_tptp_float_0_001,type,
tptp_float_0_001: $i ).
thf(tp_tptp_madd,type,
tptp_madd: $i > $i > $i ).
thf(tp_tptp_minus_1,type,
tptp_minus_1: $i ).
thf(tp_tptp_mmul,type,
tptp_mmul: $i > $i > $i ).
thf(tp_tptp_msub,type,
tptp_msub: $i > $i > $i ).
thf(tp_tptp_update2,type,
tptp_update2: $i > $i > $i > $i ).
thf(tp_tptp_update3,type,
tptp_update3: $i > $i > $i > $i > $i ).
thf(tp_trans,type,
trans: $i > $i ).
thf(tp_true,type,
true: $o ).
thf(tp_uniform_int_rnd,type,
uniform_int_rnd: $i > $i > $i ).
thf(tp_use,type,
use: $i ).
thf(34,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).
thf(78,axiom,
! [X: $i,Y: $i] :
( ( geq @ X @ Y )
<=> ( leq @ Y @ X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_geq) ).
thf(85,conjecture,
( ~ ( geq @ pv65 @ tptp_float_0_001 )
=> true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0027) ).
thf(86,negated_conjecture,
( ( ~ ( geq @ pv65 @ tptp_float_0_001 )
=> true )
= $false ),
inference(negate_conjecture,[status(cth)],[85]) ).
thf(87,plain,
( ( ~ ( geq @ pv65 @ tptp_float_0_001 )
=> true )
= $false ),
inference(unfold_def,[status(thm)],[86]) ).
thf(88,plain,
true = $true,
inference(unfold_def,[status(thm)],[34]) ).
thf(89,plain,
( ( ! [X: $i,Y: $i] :
( ( geq @ X @ Y )
<=> ( leq @ Y @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[78]) ).
thf(90,plain,
( ( ~ ( geq @ pv65 @ tptp_float_0_001 ) )
= $true ),
inference(standard_cnf,[status(thm)],[87]) ).
thf(91,plain,
true = $false,
inference(standard_cnf,[status(thm)],[87]) ).
thf(92,plain,
( ( ~ true ) = $true ),
inference(polarity_switch,[status(thm)],[91]) ).
thf(93,plain,
( ( ! [X: $i,Y: $i] :
( ( geq @ X @ Y )
<=> ( leq @ Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[89]) ).
thf(94,plain,
true = $true,
inference(copy,[status(thm)],[88]) ).
thf(95,plain,
( ( ~ ( geq @ pv65 @ tptp_float_0_001 ) )
= $true ),
inference(copy,[status(thm)],[90]) ).
thf(96,plain,
( ( ~ true ) = $true ),
inference(copy,[status(thm)],[92]) ).
thf(97,plain,
( ( ! [SX0: $i,SX1: $i] :
~ ( ~ ( ~ ( geq @ SX0 @ SX1 )
| ( leq @ SX1 @ SX0 ) )
| ~ ( ~ ( leq @ SX1 @ SX0 )
| ( geq @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[93]) ).
thf(98,plain,
( ( geq @ pv65 @ tptp_float_0_001 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[95]) ).
thf(99,plain,
true = $false,
inference(extcnf_not_pos,[status(thm)],[96]) ).
thf(100,plain,
! [SV1: $i] :
( ( ! [SY2: $i] :
~ ( ~ ( ~ ( geq @ SV1 @ SY2 )
| ( leq @ SY2 @ SV1 ) )
| ~ ( ~ ( leq @ SY2 @ SV1 )
| ( geq @ SV1 @ SY2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[97]) ).
thf(101,plain,
! [SV2: $i,SV1: $i] :
( ( ~ ( ~ ( ~ ( geq @ SV1 @ SV2 )
| ( leq @ SV2 @ SV1 ) )
| ~ ( ~ ( leq @ SV2 @ SV1 )
| ( geq @ SV1 @ SV2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[100]) ).
thf(102,plain,
! [SV2: $i,SV1: $i] :
( ( ~ ( ~ ( geq @ SV1 @ SV2 )
| ( leq @ SV2 @ SV1 ) )
| ~ ( ~ ( leq @ SV2 @ SV1 )
| ( geq @ SV1 @ SV2 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[101]) ).
thf(103,plain,
! [SV2: $i,SV1: $i] :
( ( ~ ( ~ ( geq @ SV1 @ SV2 )
| ( leq @ SV2 @ SV1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[102]) ).
thf(104,plain,
! [SV1: $i,SV2: $i] :
( ( ~ ( ~ ( leq @ SV2 @ SV1 )
| ( geq @ SV1 @ SV2 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[102]) ).
thf(105,plain,
! [SV2: $i,SV1: $i] :
( ( ~ ( geq @ SV1 @ SV2 )
| ( leq @ SV2 @ SV1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[103]) ).
thf(106,plain,
! [SV1: $i,SV2: $i] :
( ( ~ ( leq @ SV2 @ SV1 )
| ( geq @ SV1 @ SV2 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[104]) ).
thf(107,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( geq @ SV1 @ SV2 ) )
= $true )
| ( ( leq @ SV2 @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[105]) ).
thf(108,plain,
! [SV1: $i,SV2: $i] :
( ( ( ~ ( leq @ SV2 @ SV1 ) )
= $true )
| ( ( geq @ SV1 @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[106]) ).
thf(109,plain,
! [SV2: $i,SV1: $i] :
( ( ( geq @ SV1 @ SV2 )
= $false )
| ( ( leq @ SV2 @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[107]) ).
thf(110,plain,
! [SV1: $i,SV2: $i] :
( ( ( leq @ SV2 @ SV1 )
= $false )
| ( ( geq @ SV1 @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[108]) ).
thf(111,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[94,110,109,99,98]) ).
thf(112,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV086+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Oct 6 16:18:05 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.96/0.45
% 0.96/0.45 No.of.Axioms: 2
% 0.96/0.45
% 0.96/0.45 Length.of.Defs: 0
% 0.96/0.45
% 0.96/0.45 Contains.Choice.Funs: false
% 0.96/0.45 .
% 0.96/0.45
% 0.96/0.45 ********************************
% 0.96/0.45 * All subproblems solved! *
% 0.96/0.45 ********************************
% 0.96/0.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:111,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.96/0.45
% 0.96/0.45 %**** Beginning of derivation protocol ****
% 0.96/0.45 % SZS output start CNFRefutation
% See solution above
% 0.96/0.45
% 0.96/0.45 %**** End of derivation protocol ****
% 0.96/0.45 %**** no. of clauses in derivation: 30 ****
% 0.96/0.45 %**** clause counter: 111 ****
% 0.96/0.45
% 0.96/0.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:111,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------