%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : ROB016-1 : TPTP v9.3.1. Released v1.0.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:37:56 AM UTC 2026
% Result : Unsatisfiable 0.06s 0.24s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 66 ( 55 unt; 0 typ; 0 def)
% Number of atoms : 227 ( 120 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 579 ( 35 ~; 35 |; 0 &; 509 @)
% ( 0 <=>; 0 =>; 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 : 12 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 95 ( 0 ^; 95 !; 0 ?; 95 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_add,type,
add: $i > $i > $i ).
thf(tp_d,type,
d: $i ).
thf(tp_e,type,
e: $i ).
thf(tp_k,type,
k: $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(tp_negate,type,
negate: $i > $i ).
thf(tp_one,type,
one: $i ).
thf(tp_positive_integer,type,
positive_integer: $i > $o ).
thf(tp_successor,type,
successor: $i > $i ).
thf(1,axiom,
! [Y: $i,X: $i,Vk: $i] :
( ( ( negate @ ( add @ ( negate @ Y ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
!= X )
| ~ ( positive_integer @ Vk )
| ( ( negate @ ( add @ Y @ ( multiply @ Vk @ ( add @ X @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) ) ) )
= ( negate @ Y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_6) ).
thf(2,axiom,
positive_integer @ k,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_positive) ).
thf(3,axiom,
! [X: $i] :
( ~ ( positive_integer @ X )
| ( positive_integer @ ( successor @ X ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',next_integer) ).
thf(4,axiom,
positive_integer @ one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one) ).
thf(5,axiom,
! [X: $i,V: $i] :
( ~ ( positive_integer @ X )
| ( ( multiply @ ( successor @ V ) @ X )
= ( add @ X @ ( multiply @ V @ X ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',times_by_adding) ).
thf(6,axiom,
! [X: $i] :
( ( multiply @ one @ X )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_times_x) ).
thf(7,axiom,
! [X: $i,Y: $i] :
( ( negate @ ( add @ ( negate @ ( add @ X @ Y ) ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',robbins_axiom) ).
thf(8,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( add @ ( add @ X @ Y ) @ Z )
= ( add @ X @ ( add @ Y @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_add) ).
thf(9,axiom,
! [X: $i,Y: $i] :
( ( add @ X @ Y )
= ( add @ Y @ X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_add) ).
thf(10,axiom,
( ( negate @ ( add @ d @ e ) )
= ( negate @ e ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
thf(11,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(12,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[11]) ).
thf(13,negated_conjecture,
( ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) )
!= ( negate @ e ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_result) ).
thf(14,plain,
$false = $false,
inference(unfold_def,[status(thm)],[12]) ).
thf(15,plain,
( ( ! [Y: $i,X: $i,Vk: $i] :
( ( ( negate @ ( add @ ( negate @ Y ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
!= X )
| ~ ( positive_integer @ Vk )
| ( ( negate @ ( add @ Y @ ( multiply @ Vk @ ( add @ X @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) ) ) )
= ( negate @ Y ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(16,plain,
( ( positive_integer @ k )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(17,plain,
( ( ! [X: $i] :
( ~ ( positive_integer @ X )
| ( positive_integer @ ( successor @ X ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(18,plain,
( ( positive_integer @ one )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(19,plain,
( ( ! [X: $i,V: $i] :
( ~ ( positive_integer @ X )
| ( ( multiply @ ( successor @ V ) @ X )
= ( add @ X @ ( multiply @ V @ X ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(20,plain,
( ( ! [X: $i] :
( ( multiply @ one @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(21,plain,
( ( ! [X: $i,Y: $i] :
( ( negate @ ( add @ ( negate @ ( add @ X @ Y ) ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(22,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( add @ ( add @ X @ Y ) @ Z )
= ( add @ X @ ( add @ Y @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(23,plain,
( ( ! [X: $i,Y: $i] :
( ( add @ X @ Y )
= ( add @ Y @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(24,plain,
( ( ( negate @ ( add @ d @ e ) )
= ( negate @ e ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(25,plain,
( ( ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) )
!= ( negate @ e ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(26,plain,
( ( ~ $false ) = $true ),
inference(polarity_switch,[status(thm)],[14]) ).
thf(27,plain,
( ( ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) )
!= ( negate @ e ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(28,plain,
( ( ( negate @ ( add @ d @ e ) )
= ( negate @ e ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(29,plain,
( ( ! [X: $i,Y: $i] :
( ( add @ X @ Y )
= ( add @ Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(30,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( add @ ( add @ X @ Y ) @ Z )
= ( add @ X @ ( add @ Y @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(31,plain,
( ( ! [X: $i,Y: $i] :
( ( negate @ ( add @ ( negate @ ( add @ X @ Y ) ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
= X ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(32,plain,
( ( ! [X: $i] :
( ( multiply @ one @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(33,plain,
( ( ! [X: $i,V: $i] :
( ~ ( positive_integer @ X )
| ( ( multiply @ ( successor @ V ) @ X )
= ( add @ X @ ( multiply @ V @ X ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(34,plain,
( ( positive_integer @ one )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(35,plain,
( ( ! [X: $i] :
( ~ ( positive_integer @ X )
| ( positive_integer @ ( successor @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(36,plain,
( ( positive_integer @ k )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(37,plain,
( ( ! [Y: $i,X: $i,Vk: $i] :
( ( ( negate @ ( add @ ( negate @ Y ) @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) )
!= X )
| ~ ( positive_integer @ Vk )
| ( ( negate @ ( add @ Y @ ( multiply @ Vk @ ( add @ X @ ( negate @ ( add @ X @ ( negate @ Y ) ) ) ) ) ) )
= ( negate @ Y ) ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(38,plain,
( ( ~ $false ) = $true ),
inference(copy,[status(thm)],[26]) ).
thf(39,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i] :
( ( ( negate @ ( add @ ( negate @ SX0 ) @ ( negate @ ( add @ SX1 @ ( negate @ SX0 ) ) ) ) )
!= SX1 )
| ~ ( positive_integer @ SX2 )
| ( ( negate @ ( add @ SX0 @ ( multiply @ SX2 @ ( add @ SX1 @ ( negate @ ( add @ SX1 @ ( negate @ SX0 ) ) ) ) ) ) )
= ( negate @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[37]) ).
thf(40,plain,
( ( ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) )
!= ( negate @ e ) )
= $true ),
inference(unfold_def,[status(thm)],[27]) ).
thf(41,plain,
! [SV1: $i] :
( ( ! [SY14: $i] :
( ( add @ SV1 @ SY14 )
= ( add @ SY14 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(42,plain,
! [SV2: $i] :
( ( ! [SY15: $i,SY16: $i] :
( ( add @ ( add @ SV2 @ SY15 ) @ SY16 )
= ( add @ SV2 @ ( add @ SY15 @ SY16 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(43,plain,
! [SV3: $i] :
( ( ! [SY17: $i] :
( ( negate @ ( add @ ( negate @ ( add @ SV3 @ SY17 ) ) @ ( negate @ ( add @ SV3 @ ( negate @ SY17 ) ) ) ) )
= SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(44,plain,
! [SV4: $i] :
( ( ( multiply @ one @ SV4 )
= SV4 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(45,plain,
! [SV5: $i] :
( ( ! [SY18: $i] :
( ~ ( positive_integer @ SV5 )
| ( ( multiply @ ( successor @ SY18 ) @ SV5 )
= ( add @ SV5 @ ( multiply @ SY18 @ SV5 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(46,plain,
! [SV6: $i] :
( ( ~ ( positive_integer @ SV6 )
| ( positive_integer @ ( successor @ SV6 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(47,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(48,plain,
! [SV7: $i] :
( ( ! [SY19: $i,SY20: $i] :
( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SY19 @ ( negate @ SV7 ) ) ) ) )
!= SY19 )
| ~ ( positive_integer @ SY20 )
| ( ( negate @ ( add @ SV7 @ ( multiply @ SY20 @ ( add @ SY19 @ ( negate @ ( add @ SY19 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(49,plain,
( ( ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) )
= ( negate @ e ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(50,plain,
! [SV8: $i,SV1: $i] :
( ( ( add @ SV1 @ SV8 )
= ( add @ SV8 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(51,plain,
! [SV9: $i,SV2: $i] :
( ( ! [SY21: $i] :
( ( add @ ( add @ SV2 @ SV9 ) @ SY21 )
= ( add @ SV2 @ ( add @ SV9 @ SY21 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(52,plain,
! [SV10: $i,SV3: $i] :
( ( ( negate @ ( add @ ( negate @ ( add @ SV3 @ SV10 ) ) @ ( negate @ ( add @ SV3 @ ( negate @ SV10 ) ) ) ) )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(53,plain,
! [SV11: $i,SV5: $i] :
( ( ~ ( positive_integer @ SV5 )
| ( ( multiply @ ( successor @ SV11 ) @ SV5 )
= ( add @ SV5 @ ( multiply @ SV11 @ SV5 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(54,plain,
! [SV6: $i] :
( ( ( ~ ( positive_integer @ SV6 ) )
= $true )
| ( ( positive_integer @ ( successor @ SV6 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(55,plain,
! [SV12: $i,SV7: $i] :
( ( ! [SY22: $i] :
( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) )
!= SV12 )
| ~ ( positive_integer @ SY22 )
| ( ( negate @ ( add @ SV7 @ ( multiply @ SY22 @ ( add @ SV12 @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[48]) ).
thf(56,plain,
! [SV13: $i,SV9: $i,SV2: $i] :
( ( ( add @ ( add @ SV2 @ SV9 ) @ SV13 )
= ( add @ SV2 @ ( add @ SV9 @ SV13 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(57,plain,
! [SV11: $i,SV5: $i] :
( ( ( ~ ( positive_integer @ SV5 ) )
= $true )
| ( ( ( multiply @ ( successor @ SV11 ) @ SV5 )
= ( add @ SV5 @ ( multiply @ SV11 @ SV5 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(58,plain,
! [SV6: $i] :
( ( ( positive_integer @ SV6 )
= $false )
| ( ( positive_integer @ ( successor @ SV6 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(59,plain,
! [SV14: $i,SV12: $i,SV7: $i] :
( ( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) )
!= SV12 )
| ~ ( positive_integer @ SV14 )
| ( ( negate @ ( add @ SV7 @ ( multiply @ SV14 @ ( add @ SV12 @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[55]) ).
thf(60,plain,
! [SV11: $i,SV5: $i] :
( ( ( positive_integer @ SV5 )
= $false )
| ( ( ( multiply @ ( successor @ SV11 ) @ SV5 )
= ( add @ SV5 @ ( multiply @ SV11 @ SV5 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[57]) ).
thf(61,plain,
! [SV14: $i,SV12: $i,SV7: $i] :
( ( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) )
!= SV12 )
= $true )
| ( ( ~ ( positive_integer @ SV14 )
| ( ( negate @ ( add @ SV7 @ ( multiply @ SV14 @ ( add @ SV12 @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[59]) ).
thf(62,plain,
! [SV14: $i,SV12: $i,SV7: $i] :
( ( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) )
= SV12 )
= $false )
| ( ( ~ ( positive_integer @ SV14 )
| ( ( negate @ ( add @ SV7 @ ( multiply @ SV14 @ ( add @ SV12 @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[61]) ).
thf(63,plain,
! [SV12: $i,SV7: $i,SV14: $i] :
( ( ( ~ ( positive_integer @ SV14 ) )
= $true )
| ( ( ( negate @ ( add @ SV7 @ ( multiply @ SV14 @ ( add @ SV12 @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) )
= $true )
| ( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) )
= SV12 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[62]) ).
thf(64,plain,
! [SV12: $i,SV7: $i,SV14: $i] :
( ( ( positive_integer @ SV14 )
= $false )
| ( ( ( negate @ ( add @ SV7 @ ( multiply @ SV14 @ ( add @ SV12 @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) ) ) )
= ( negate @ SV7 ) )
= $true )
| ( ( ( negate @ ( add @ ( negate @ SV7 ) @ ( negate @ ( add @ SV12 @ ( negate @ SV7 ) ) ) ) )
= SV12 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[63]) ).
thf(65,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[28,64,60,58,56,52,50,49,47,44,36,34]) ).
thf(66,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB016-1 : TPTP v9.3.1. Released v1.0.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.06/0.17 % Computer : n006.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Oct 6 14:16:37 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 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.06/0.24
% 0.06/0.24 No.of.Axioms: 11
% 0.06/0.24
% 0.06/0.24 Length.of.Defs: 0
% 0.06/0.24
% 0.06/0.24 Contains.Choice.Funs: false
% 0.06/0.24 .
% 0.06/0.24
% 0.06/0.24 ********************************
% 0.06/0.24 * All subproblems solved! *
% 0.06/0.24 ********************************
% 0.06/0.24 % SZS status Unsatisfiable 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:65,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.06/0.24
% 0.06/0.24 %**** Beginning of derivation protocol ****
% 0.06/0.24 % SZS output start CNFRefutation
% See solution above
% 0.06/0.24
% 0.06/0.24 %**** End of derivation protocol ****
% 0.06/0.24 %**** no. of clauses in derivation: 66 ****
% 0.06/0.24 %**** clause counter: 65 ****
% 0.06/0.24
% 0.06/0.24 % SZS status Unsatisfiable 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:65,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------