%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM022-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 : n009.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:32:49 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.21s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 75 ( 49 unt; 0 typ; 0 def)
% Number of atoms : 334 ( 87 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 516 ( 68 ~; 85 |; 0 &; 363 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 142 ( 0 ^; 142 !; 0 ?; 142 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_add,type,
add: $i > $i > $i ).
thf(tp_b,type,
b: $i ).
thf(tp_d,type,
d: $i ).
thf(tp_divides,type,
divides: $i > $i > $o ).
thf(tp_equalish,type,
equalish: $i > $i > $o ).
thf(tp_less,type,
less: $i > $i > $o ).
thf(tp_predecessor_of_1st_minus_2nd,type,
predecessor_of_1st_minus_2nd: $i > $i > $i ).
thf(tp_successor,type,
successor: $i > $i ).
thf(1,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( equalish @ A @ B )
| ~ ( equalish @ C @ A )
| ( equalish @ C @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
thf(2,axiom,
! [A: $i,B: $i] :
( ~ ( equalish @ A @ B )
| ( divides @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_if_equal) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ~ ( less @ A @ B )
| ( divides @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_if_less) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ~ ( divides @ A @ B )
| ( less @ A @ B )
| ( equalish @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_only_less_or_equal) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ~ ( less @ A @ B )
| ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_lemma) ).
thf(6,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( equalish @ ( add @ ( successor @ A ) @ B ) @ C )
| ( less @ B @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',smaller_number) ).
thf(7,axiom,
! [A: $i,B: $i,C: $i] :
( ~ ( less @ A @ B )
| ~ ( less @ C @ A )
| ( less @ C @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
thf(8,axiom,
divides @ b @ d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_divides_d) ).
thf(9,axiom,
less @ a @ b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_less_than_b) ).
thf(10,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(11,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[10]) ).
thf(12,negated_conjecture,
~ ( less @ a @ d ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_less_than_d) ).
thf(13,plain,
$false = $false,
inference(unfold_def,[status(thm)],[11]) ).
thf(14,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( equalish @ A @ B )
| ~ ( equalish @ C @ A )
| ( equalish @ C @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(15,plain,
( ( ! [A: $i,B: $i] :
( ~ ( equalish @ A @ B )
| ( divides @ A @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(16,plain,
( ( ! [A: $i,B: $i] :
( ~ ( less @ A @ B )
| ( divides @ A @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(17,plain,
( ( ! [A: $i,B: $i] :
( ~ ( divides @ A @ B )
| ( less @ A @ B )
| ( equalish @ A @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] :
( ~ ( less @ A @ B )
| ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(19,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( equalish @ ( add @ ( successor @ A ) @ B ) @ C )
| ( less @ B @ C ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(20,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( less @ A @ B )
| ~ ( less @ C @ A )
| ( less @ C @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(21,plain,
( ( divides @ b @ d )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(22,plain,
( ( less @ a @ b )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(23,plain,
( ( ~ ( less @ a @ d ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(24,plain,
( ( ~ $false ) = $true ),
inference(polarity_switch,[status(thm)],[13]) ).
thf(25,plain,
( ( ~ ( less @ a @ d ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(26,plain,
( ( less @ a @ b )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(27,plain,
( ( divides @ b @ d )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(28,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( less @ A @ B )
| ~ ( less @ C @ A )
| ( less @ C @ B ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(29,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( equalish @ ( add @ ( successor @ A ) @ B ) @ C )
| ( less @ B @ C ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(30,plain,
( ( ! [A: $i,B: $i] :
( ~ ( less @ A @ B )
| ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @ B ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(31,plain,
( ( ! [A: $i,B: $i] :
( ~ ( divides @ A @ B )
| ( less @ A @ B )
| ( equalish @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(32,plain,
( ( ! [A: $i,B: $i] :
( ~ ( less @ A @ B )
| ( divides @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(33,plain,
( ( ! [A: $i,B: $i] :
( ~ ( equalish @ A @ B )
| ( divides @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(34,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ~ ( equalish @ A @ B )
| ~ ( equalish @ C @ A )
| ( equalish @ C @ B ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(35,plain,
( ( ~ $false ) = $true ),
inference(copy,[status(thm)],[24]) ).
thf(36,plain,
( ( less @ a @ d )
= $false ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(37,plain,
! [SV1: $i] :
( ( ! [SY17: $i,SY18: $i] :
( ~ ( less @ SV1 @ SY17 )
| ~ ( less @ SY18 @ SV1 )
| ( less @ SY18 @ SY17 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(38,plain,
! [SV2: $i] :
( ( ! [SY19: $i,SY20: $i] :
( ~ ( equalish @ ( add @ ( successor @ SV2 ) @ SY19 ) @ SY20 )
| ( less @ SY19 @ SY20 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(39,plain,
! [SV3: $i] :
( ( ! [SY21: $i] :
( ~ ( less @ SV3 @ SY21 )
| ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ SY21 @ SV3 ) ) @ SV3 ) @ SY21 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(40,plain,
! [SV4: $i] :
( ( ! [SY22: $i] :
( ~ ( divides @ SV4 @ SY22 )
| ( less @ SV4 @ SY22 )
| ( equalish @ SV4 @ SY22 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(41,plain,
! [SV5: $i] :
( ( ! [SY23: $i] :
( ~ ( less @ SV5 @ SY23 )
| ( divides @ SV5 @ SY23 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(42,plain,
! [SV6: $i] :
( ( ! [SY24: $i] :
( ~ ( equalish @ SV6 @ SY24 )
| ( divides @ SV6 @ SY24 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(43,plain,
! [SV7: $i] :
( ( ! [SY25: $i,SY26: $i] :
( ~ ( equalish @ SV7 @ SY25 )
| ~ ( equalish @ SY26 @ SV7 )
| ( equalish @ SY26 @ SY25 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(44,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(45,plain,
! [SV8: $i,SV1: $i] :
( ( ! [SY27: $i] :
( ~ ( less @ SV1 @ SV8 )
| ~ ( less @ SY27 @ SV1 )
| ( less @ SY27 @ SV8 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(46,plain,
! [SV9: $i,SV2: $i] :
( ( ! [SY28: $i] :
( ~ ( equalish @ ( add @ ( successor @ SV2 ) @ SV9 ) @ SY28 )
| ( less @ SV9 @ SY28 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(47,plain,
! [SV10: $i,SV3: $i] :
( ( ~ ( less @ SV3 @ SV10 )
| ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ SV10 @ SV3 ) ) @ SV3 ) @ SV10 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(48,plain,
! [SV11: $i,SV4: $i] :
( ( ~ ( divides @ SV4 @ SV11 )
| ( less @ SV4 @ SV11 )
| ( equalish @ SV4 @ SV11 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(49,plain,
! [SV12: $i,SV5: $i] :
( ( ~ ( less @ SV5 @ SV12 )
| ( divides @ SV5 @ SV12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(50,plain,
! [SV13: $i,SV6: $i] :
( ( ~ ( equalish @ SV6 @ SV13 )
| ( divides @ SV6 @ SV13 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(51,plain,
! [SV14: $i,SV7: $i] :
( ( ! [SY29: $i] :
( ~ ( equalish @ SV7 @ SV14 )
| ~ ( equalish @ SY29 @ SV7 )
| ( equalish @ SY29 @ SV14 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(52,plain,
! [SV15: $i,SV8: $i,SV1: $i] :
( ( ~ ( less @ SV1 @ SV8 )
| ~ ( less @ SV15 @ SV1 )
| ( less @ SV15 @ SV8 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[45]) ).
thf(53,plain,
! [SV16: $i,SV9: $i,SV2: $i] :
( ( ~ ( equalish @ ( add @ ( successor @ SV2 ) @ SV9 ) @ SV16 )
| ( less @ SV9 @ SV16 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(54,plain,
! [SV10: $i,SV3: $i] :
( ( ( ~ ( less @ SV3 @ SV10 ) )
= $true )
| ( ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ SV10 @ SV3 ) ) @ SV3 ) @ SV10 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(55,plain,
! [SV11: $i,SV4: $i] :
( ( ( ~ ( divides @ SV4 @ SV11 ) )
= $true )
| ( ( ( less @ SV4 @ SV11 )
| ( equalish @ SV4 @ SV11 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[48]) ).
thf(56,plain,
! [SV12: $i,SV5: $i] :
( ( ( ~ ( less @ SV5 @ SV12 ) )
= $true )
| ( ( divides @ SV5 @ SV12 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[49]) ).
thf(57,plain,
! [SV13: $i,SV6: $i] :
( ( ( ~ ( equalish @ SV6 @ SV13 ) )
= $true )
| ( ( divides @ SV6 @ SV13 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(58,plain,
! [SV17: $i,SV14: $i,SV7: $i] :
( ( ~ ( equalish @ SV7 @ SV14 )
| ~ ( equalish @ SV17 @ SV7 )
| ( equalish @ SV17 @ SV14 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[51]) ).
thf(59,plain,
! [SV15: $i,SV8: $i,SV1: $i] :
( ( ( ~ ( less @ SV1 @ SV8 ) )
= $true )
| ( ( ~ ( less @ SV15 @ SV1 )
| ( less @ SV15 @ SV8 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[52]) ).
thf(60,plain,
! [SV16: $i,SV9: $i,SV2: $i] :
( ( ( ~ ( equalish @ ( add @ ( successor @ SV2 ) @ SV9 ) @ SV16 ) )
= $true )
| ( ( less @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(61,plain,
! [SV10: $i,SV3: $i] :
( ( ( less @ SV3 @ SV10 )
= $false )
| ( ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ SV10 @ SV3 ) ) @ SV3 ) @ SV10 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(62,plain,
! [SV11: $i,SV4: $i] :
( ( ( divides @ SV4 @ SV11 )
= $false )
| ( ( ( less @ SV4 @ SV11 )
| ( equalish @ SV4 @ SV11 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(63,plain,
! [SV12: $i,SV5: $i] :
( ( ( less @ SV5 @ SV12 )
= $false )
| ( ( divides @ SV5 @ SV12 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(64,plain,
! [SV13: $i,SV6: $i] :
( ( ( equalish @ SV6 @ SV13 )
= $false )
| ( ( divides @ SV6 @ SV13 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[57]) ).
thf(65,plain,
! [SV17: $i,SV14: $i,SV7: $i] :
( ( ( ~ ( equalish @ SV7 @ SV14 ) )
= $true )
| ( ( ~ ( equalish @ SV17 @ SV7 )
| ( equalish @ SV17 @ SV14 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[58]) ).
thf(66,plain,
! [SV15: $i,SV8: $i,SV1: $i] :
( ( ( less @ SV1 @ SV8 )
= $false )
| ( ( ~ ( less @ SV15 @ SV1 )
| ( less @ SV15 @ SV8 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[59]) ).
thf(67,plain,
! [SV16: $i,SV9: $i,SV2: $i] :
( ( ( equalish @ ( add @ ( successor @ SV2 ) @ SV9 ) @ SV16 )
= $false )
| ( ( less @ SV9 @ SV16 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[60]) ).
thf(68,plain,
! [SV11: $i,SV4: $i] :
( ( ( less @ SV4 @ SV11 )
= $true )
| ( ( equalish @ SV4 @ SV11 )
= $true )
| ( ( divides @ SV4 @ SV11 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[62]) ).
thf(69,plain,
! [SV17: $i,SV14: $i,SV7: $i] :
( ( ( equalish @ SV7 @ SV14 )
= $false )
| ( ( ~ ( equalish @ SV17 @ SV7 )
| ( equalish @ SV17 @ SV14 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[65]) ).
thf(70,plain,
! [SV8: $i,SV1: $i,SV15: $i] :
( ( ( ~ ( less @ SV15 @ SV1 ) )
= $true )
| ( ( less @ SV15 @ SV8 )
= $true )
| ( ( less @ SV1 @ SV8 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[66]) ).
thf(71,plain,
! [SV14: $i,SV7: $i,SV17: $i] :
( ( ( ~ ( equalish @ SV17 @ SV7 ) )
= $true )
| ( ( equalish @ SV17 @ SV14 )
= $true )
| ( ( equalish @ SV7 @ SV14 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[69]) ).
thf(72,plain,
! [SV8: $i,SV1: $i,SV15: $i] :
( ( ( less @ SV15 @ SV1 )
= $false )
| ( ( less @ SV15 @ SV8 )
= $true )
| ( ( less @ SV1 @ SV8 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[70]) ).
thf(73,plain,
! [SV14: $i,SV7: $i,SV17: $i] :
( ( ( equalish @ SV17 @ SV7 )
= $false )
| ( ( equalish @ SV17 @ SV14 )
= $true )
| ( ( equalish @ SV7 @ SV14 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[71]) ).
thf(74,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[26,73,72,68,67,64,63,61,44,36,27]) ).
thf(75,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM022-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.09/0.16 % Computer : n009.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Oct 6 13:00:17 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 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.09/0.21
% 0.09/0.21 No.of.Axioms: 10
% 0.09/0.21
% 0.09/0.21 Length.of.Defs: 0
% 0.09/0.21
% 0.09/0.21 Contains.Choice.Funs: false
% 0.09/0.21 .
% 0.09/0.21
% 0.09/0.21 ********************************
% 0.09/0.21 * All subproblems solved! *
% 0.09/0.21 ********************************
% 0.09/0.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:10,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:74,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.21
% 0.09/0.21 %**** Beginning of derivation protocol ****
% 0.09/0.21 % SZS output start CNFRefutation
% See solution above
% 0.09/0.21
% 0.09/0.21 %**** End of derivation protocol ****
% 0.09/0.21 %**** no. of clauses in derivation: 75 ****
% 0.09/0.21 %**** clause counter: 74 ****
% 0.09/0.21
% 0.09/0.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:10,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:74,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------