%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SWV088+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 : n004.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:48 AM UTC 2026
% Result : Theorem 0.64s 0.28s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 52 unt; 0 typ; 0 def)
% Number of atoms : 350 ( 133 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 434 ( 73 ~; 71 |; 6 &; 269 @)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 37 ( 34 usr; 14 con; 0-4 aty)
% Number of variables : 73 ( 0 ^; 73 !; 0 ?; 73 :)
% 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_n135300,type,
n135300: $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_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_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(3,axiom,
( ( succ @ n0 )
= n1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
thf(8,axiom,
! [X: $i] :
( ( ( leq @ n0 @ X )
& ( leq @ X @ n1 ) )
=> ( ( X = n0 )
| ( X = n1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_1) ).
thf(9,axiom,
! [X: $i] :
( ( ( leq @ n0 @ X )
& ( leq @ X @ n0 ) )
=> ( X = n0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
thf(21,axiom,
gt @ n135300 @ n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_135300_1) ).
thf(26,axiom,
gt @ n1 @ n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
thf(27,axiom,
gt @ n135300 @ n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_135300_0) ).
thf(41,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ttrue) ).
thf(48,axiom,
! [X: $i,Y: $i] :
( ( leq @ ( minus @ X @ Y ) @ X )
=> ( leq @ n0 @ Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_minus) ).
thf(53,axiom,
! [X: $i] :
( ( minus @ X @ n1 )
= ( pred @ X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
thf(85,axiom,
! [X: $i,Y: $i] :
( ( geq @ X @ Y )
<=> ( leq @ Y @ X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_geq) ).
thf(92,conjecture,
( ( geq @ ( minus @ n135300 @ n1 ) @ n0 )
=> true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0029) ).
thf(93,negated_conjecture,
( ( ( geq @ ( minus @ n135300 @ n1 ) @ n0 )
=> true )
= $false ),
inference(negate_conjecture,[status(cth)],[92]) ).
thf(94,plain,
( ( ( geq @ ( minus @ n135300 @ n1 ) @ n0 )
=> true )
= $false ),
inference(unfold_def,[status(thm)],[93]) ).
thf(95,plain,
( ( ( succ @ n0 )
= n1 )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(96,plain,
( ( ! [X: $i] :
( ( ( leq @ n0 @ X )
& ( leq @ X @ n1 ) )
=> ( ( X = n0 )
| ( X = n1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(97,plain,
( ( ! [X: $i] :
( ( ( leq @ n0 @ X )
& ( leq @ X @ n0 ) )
=> ( X = n0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(98,plain,
( ( gt @ n135300 @ n1 )
= $true ),
inference(unfold_def,[status(thm)],[21]) ).
thf(99,plain,
( ( gt @ n1 @ n0 )
= $true ),
inference(unfold_def,[status(thm)],[26]) ).
thf(100,plain,
( ( gt @ n135300 @ n0 )
= $true ),
inference(unfold_def,[status(thm)],[27]) ).
thf(101,plain,
true = $true,
inference(unfold_def,[status(thm)],[41]) ).
thf(102,plain,
( ( ! [X: $i,Y: $i] :
( ( leq @ ( minus @ X @ Y ) @ X )
=> ( leq @ n0 @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[48]) ).
thf(103,plain,
( ( ! [X: $i] :
( ( minus @ X @ n1 )
= ( pred @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[53]) ).
thf(104,plain,
( ( ! [X: $i,Y: $i] :
( ( geq @ X @ Y )
<=> ( leq @ Y @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[85]) ).
thf(105,plain,
( ( geq @ ( minus @ n135300 @ n1 ) @ n0 )
= $true ),
inference(standard_cnf,[status(thm)],[94]) ).
thf(106,plain,
true = $false,
inference(standard_cnf,[status(thm)],[94]) ).
thf(107,plain,
( ( ~ true ) = $true ),
inference(polarity_switch,[status(thm)],[106]) ).
thf(108,plain,
( ( ! [X: $i,Y: $i] :
( ( geq @ X @ Y )
<=> ( leq @ Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[104]) ).
thf(109,plain,
( ( ! [X: $i] :
( ( minus @ X @ n1 )
= ( pred @ X ) ) )
= $true ),
inference(copy,[status(thm)],[103]) ).
thf(110,plain,
( ( ! [X: $i,Y: $i] :
( ( leq @ ( minus @ X @ Y ) @ X )
=> ( leq @ n0 @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[102]) ).
thf(111,plain,
true = $true,
inference(copy,[status(thm)],[101]) ).
thf(112,plain,
( ( gt @ n135300 @ n0 )
= $true ),
inference(copy,[status(thm)],[100]) ).
thf(113,plain,
( ( gt @ n1 @ n0 )
= $true ),
inference(copy,[status(thm)],[99]) ).
thf(114,plain,
( ( gt @ n135300 @ n1 )
= $true ),
inference(copy,[status(thm)],[98]) ).
thf(115,plain,
( ( ! [X: $i] :
( ( ( leq @ n0 @ X )
& ( leq @ X @ n0 ) )
=> ( X = n0 ) ) )
= $true ),
inference(copy,[status(thm)],[97]) ).
thf(116,plain,
( ( ! [X: $i] :
( ( ( leq @ n0 @ X )
& ( leq @ X @ n1 ) )
=> ( ( X = n0 )
| ( X = n1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[96]) ).
thf(117,plain,
( ( ( succ @ n0 )
= n1 )
= $true ),
inference(copy,[status(thm)],[95]) ).
thf(118,plain,
( ( geq @ ( minus @ n135300 @ n1 ) @ n0 )
= $true ),
inference(copy,[status(thm)],[105]) ).
thf(119,plain,
( ( ~ true ) = $true ),
inference(copy,[status(thm)],[107]) ).
thf(120,plain,
( ( ! [SX0: $i] :
( ~ ~ ( ~ ( leq @ n0 @ SX0 )
| ~ ( leq @ SX0 @ n0 ) )
| ( SX0 = n0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[115]) ).
thf(121,plain,
( ( ! [SX0: $i] :
( ~ ~ ( ~ ( leq @ n0 @ SX0 )
| ~ ( leq @ SX0 @ n1 ) )
| ( SX0 = n0 )
| ( SX0 = n1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[116]) ).
thf(122,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( leq @ ( minus @ SX0 @ SX1 ) @ SX0 )
| ( leq @ n0 @ SX1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[110]) ).
thf(123,plain,
( ( ! [SX0: $i,SX1: $i] :
~ ( ~ ( ~ ( geq @ SX0 @ SX1 )
| ( leq @ SX1 @ SX0 ) )
| ~ ( ~ ( leq @ SX1 @ SX0 )
| ( geq @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[108]) ).
thf(124,plain,
! [SV1: $i] :
( ( ( minus @ SV1 @ n1 )
= ( pred @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[109]) ).
thf(125,plain,
true = $false,
inference(extcnf_not_pos,[status(thm)],[119]) ).
thf(126,plain,
! [SV2: $i] :
( ( ~ ~ ( ~ ( leq @ n0 @ SV2 )
| ~ ( leq @ SV2 @ n0 ) )
| ( SV2 = n0 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[120]) ).
thf(127,plain,
! [SV3: $i] :
( ( ~ ~ ( ~ ( leq @ n0 @ SV3 )
| ~ ( leq @ SV3 @ n1 ) )
| ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[121]) ).
thf(128,plain,
! [SV4: $i] :
( ( ! [SY7: $i] :
( ~ ( leq @ ( minus @ SV4 @ SY7 ) @ SV4 )
| ( leq @ n0 @ SY7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[122]) ).
thf(129,plain,
! [SV5: $i] :
( ( ! [SY8: $i] :
~ ( ~ ( ~ ( geq @ SV5 @ SY8 )
| ( leq @ SY8 @ SV5 ) )
| ~ ( ~ ( leq @ SY8 @ SV5 )
| ( geq @ SV5 @ SY8 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[123]) ).
thf(130,plain,
! [SV2: $i] :
( ( ( ~ ~ ( ~ ( leq @ n0 @ SV2 )
| ~ ( leq @ SV2 @ n0 ) ) )
= $true )
| ( ( SV2 = n0 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[126]) ).
thf(131,plain,
! [SV3: $i] :
( ( ( ~ ~ ( ~ ( leq @ n0 @ SV3 )
| ~ ( leq @ SV3 @ n1 ) ) )
= $true )
| ( ( ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[127]) ).
thf(132,plain,
! [SV6: $i,SV4: $i] :
( ( ~ ( leq @ ( minus @ SV4 @ SV6 ) @ SV4 )
| ( leq @ n0 @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[128]) ).
thf(133,plain,
! [SV7: $i,SV5: $i] :
( ( ~ ( ~ ( ~ ( geq @ SV5 @ SV7 )
| ( leq @ SV7 @ SV5 ) )
| ~ ( ~ ( leq @ SV7 @ SV5 )
| ( geq @ SV5 @ SV7 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[129]) ).
thf(134,plain,
! [SV2: $i] :
( ( ( ~ ( ~ ( leq @ n0 @ SV2 )
| ~ ( leq @ SV2 @ n0 ) ) )
= $false )
| ( ( SV2 = n0 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[130]) ).
thf(135,plain,
! [SV3: $i] :
( ( ( ~ ( ~ ( leq @ n0 @ SV3 )
| ~ ( leq @ SV3 @ n1 ) ) )
= $false )
| ( ( ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[131]) ).
thf(136,plain,
! [SV6: $i,SV4: $i] :
( ( ( ~ ( leq @ ( minus @ SV4 @ SV6 ) @ SV4 ) )
= $true )
| ( ( leq @ n0 @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[132]) ).
thf(137,plain,
! [SV7: $i,SV5: $i] :
( ( ~ ( ~ ( geq @ SV5 @ SV7 )
| ( leq @ SV7 @ SV5 ) )
| ~ ( ~ ( leq @ SV7 @ SV5 )
| ( geq @ SV5 @ SV7 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[133]) ).
thf(138,plain,
! [SV2: $i] :
( ( ( ~ ( leq @ n0 @ SV2 )
| ~ ( leq @ SV2 @ n0 ) )
= $true )
| ( ( SV2 = n0 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[134]) ).
thf(139,plain,
! [SV3: $i] :
( ( ( ~ ( leq @ n0 @ SV3 )
| ~ ( leq @ SV3 @ n1 ) )
= $true )
| ( ( ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[135]) ).
thf(140,plain,
! [SV6: $i,SV4: $i] :
( ( ( leq @ ( minus @ SV4 @ SV6 ) @ SV4 )
= $false )
| ( ( leq @ n0 @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[136]) ).
thf(141,plain,
! [SV7: $i,SV5: $i] :
( ( ~ ( ~ ( geq @ SV5 @ SV7 )
| ( leq @ SV7 @ SV5 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[137]) ).
thf(142,plain,
! [SV5: $i,SV7: $i] :
( ( ~ ( ~ ( leq @ SV7 @ SV5 )
| ( geq @ SV5 @ SV7 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[137]) ).
thf(143,plain,
! [SV2: $i] :
( ( ( ~ ( leq @ n0 @ SV2 ) )
= $true )
| ( ( ~ ( leq @ SV2 @ n0 ) )
= $true )
| ( ( SV2 = n0 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[138]) ).
thf(144,plain,
! [SV3: $i] :
( ( ( ~ ( leq @ n0 @ SV3 ) )
= $true )
| ( ( ~ ( leq @ SV3 @ n1 ) )
= $true )
| ( ( ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[139]) ).
thf(145,plain,
! [SV7: $i,SV5: $i] :
( ( ~ ( geq @ SV5 @ SV7 )
| ( leq @ SV7 @ SV5 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[141]) ).
thf(146,plain,
! [SV5: $i,SV7: $i] :
( ( ~ ( leq @ SV7 @ SV5 )
| ( geq @ SV5 @ SV7 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[142]) ).
thf(147,plain,
! [SV2: $i] :
( ( ( leq @ n0 @ SV2 )
= $false )
| ( ( ~ ( leq @ SV2 @ n0 ) )
= $true )
| ( ( SV2 = n0 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[143]) ).
thf(148,plain,
! [SV3: $i] :
( ( ( leq @ n0 @ SV3 )
= $false )
| ( ( ~ ( leq @ SV3 @ n1 ) )
= $true )
| ( ( ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[144]) ).
thf(149,plain,
! [SV7: $i,SV5: $i] :
( ( ( ~ ( geq @ SV5 @ SV7 ) )
= $true )
| ( ( leq @ SV7 @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[145]) ).
thf(150,plain,
! [SV5: $i,SV7: $i] :
( ( ( ~ ( leq @ SV7 @ SV5 ) )
= $true )
| ( ( geq @ SV5 @ SV7 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[146]) ).
thf(151,plain,
! [SV2: $i] :
( ( ( leq @ SV2 @ n0 )
= $false )
| ( ( leq @ n0 @ SV2 )
= $false )
| ( ( SV2 = n0 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[147]) ).
thf(152,plain,
! [SV3: $i] :
( ( ( leq @ SV3 @ n1 )
= $false )
| ( ( leq @ n0 @ SV3 )
= $false )
| ( ( ( SV3 = n0 )
| ( SV3 = n1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[148]) ).
thf(153,plain,
! [SV7: $i,SV5: $i] :
( ( ( geq @ SV5 @ SV7 )
= $false )
| ( ( leq @ SV7 @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[149]) ).
thf(154,plain,
! [SV5: $i,SV7: $i] :
( ( ( leq @ SV7 @ SV5 )
= $false )
| ( ( geq @ SV5 @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[150]) ).
thf(155,plain,
! [SV3: $i] :
( ( ( SV3 = n0 )
= $true )
| ( ( SV3 = n1 )
= $true )
| ( ( leq @ n0 @ SV3 )
= $false )
| ( ( leq @ SV3 @ n1 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[152]) ).
thf(156,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[111,155,154,153,151,140,125,124,118,117,114,113,112]) ).
thf(157,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV088+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.16 % Computer : n004.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Tue Oct 6 16:19:17 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 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.64/0.28
% 0.64/0.28 No.of.Axioms: 10
% 0.64/0.28
% 0.64/0.28 Length.of.Defs: 0
% 0.64/0.28
% 0.64/0.28 Contains.Choice.Funs: false
% 0.64/0.28 ..
% 0.64/0.28
% 0.64/0.28 ********************************
% 0.64/0.28 * All subproblems solved! *
% 0.64/0.28 ********************************
% 0.64/0.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:11,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:156,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.64/0.28
% 0.64/0.28 %**** Beginning of derivation protocol ****
% 0.64/0.28 % SZS output start CNFRefutation
% See solution above
% 0.64/0.28
% 0.64/0.28 %**** End of derivation protocol ****
% 0.64/0.28 %**** no. of clauses in derivation: 76 ****
% 0.64/0.28 %**** clause counter: 156 ****
% 0.64/0.28
% 0.64/0.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:11,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:156,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------