%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM729^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:35:03 AM UTC 2026
% Result : Theorem 0.09s 0.24s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 20 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 167 ( 7 ~; 6 |; 0 &; 152 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 ^; 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_frac,type,
frac: $tType ).
thf(tp_nat,type,
nat: $tType ).
thf(tp_eq,type,
eq: frac > frac > $o ).
thf(tp_fr,type,
fr: nat > nat > frac ).
thf(tp_n,type,
n: nat ).
thf(tp_ts,type,
ts: nat > nat > nat ).
thf(tp_x1,type,
x1: nat ).
thf(tp_x2,type,
x2: nat ).
thf(1,axiom,
! [Xx1: nat,Xx2: nat,Xn: nat] : ( eq @ ( fr @ Xx1 @ Xx2 ) @ ( fr @ ( ts @ Xx1 @ Xn ) @ ( ts @ Xx2 @ Xn ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz40b) ).
thf(2,axiom,
! [Xx: frac,Xy: frac] :
( ( eq @ Xx @ Xy )
=> ( eq @ Xy @ Xx ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz38) ).
thf(3,conjecture,
eq @ ( fr @ ( ts @ x1 @ n ) @ ( ts @ x2 @ n ) ) @ ( fr @ x1 @ x2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz40c) ).
thf(4,negated_conjecture,
( ( eq @ ( fr @ ( ts @ x1 @ n ) @ ( ts @ x2 @ n ) ) @ ( fr @ x1 @ x2 ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( eq @ ( fr @ ( ts @ x1 @ n ) @ ( ts @ x2 @ n ) ) @ ( fr @ x1 @ x2 ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [Xx1: nat,Xx2: nat,Xn: nat] : ( eq @ ( fr @ Xx1 @ Xx2 ) @ ( fr @ ( ts @ Xx1 @ Xn ) @ ( ts @ Xx2 @ Xn ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ! [Xx: frac,Xy: frac] :
( ( eq @ Xx @ Xy )
=> ( eq @ Xy @ Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ~ ( eq @ ( fr @ ( ts @ x1 @ n ) @ ( ts @ x2 @ n ) ) @ ( fr @ x1 @ x2 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ! [Xx: frac,Xy: frac] :
( ~ ( eq @ Xx @ Xy )
| ( eq @ Xy @ Xx ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( ! [Xx: frac,Xy: frac] :
( ~ ( eq @ Xx @ Xy )
| ( eq @ Xy @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ! [Xx1: nat,Xx2: nat,Xn: nat] : ( eq @ ( fr @ Xx1 @ Xx2 ) @ ( fr @ ( ts @ Xx1 @ Xn ) @ ( ts @ Xx2 @ Xn ) ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ~ ( eq @ ( fr @ ( ts @ x1 @ n ) @ ( ts @ x2 @ n ) ) @ ( fr @ x1 @ x2 ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
! [SV1: frac] :
( ( ! [SY5: frac] :
( ~ ( eq @ SV1 @ SY5 )
| ( eq @ SY5 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(14,plain,
! [SV2: nat] :
( ( ! [SY6: nat,SY7: nat] : ( eq @ ( fr @ SV2 @ SY6 ) @ ( fr @ ( ts @ SV2 @ SY7 ) @ ( ts @ SY6 @ SY7 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
( ( eq @ ( fr @ ( ts @ x1 @ n ) @ ( ts @ x2 @ n ) ) @ ( fr @ x1 @ x2 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(16,plain,
! [SV3: frac,SV1: frac] :
( ( ~ ( eq @ SV1 @ SV3 )
| ( eq @ SV3 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV4: nat,SV2: nat] :
( ( ! [SY8: nat] : ( eq @ ( fr @ SV2 @ SV4 ) @ ( fr @ ( ts @ SV2 @ SY8 ) @ ( ts @ SV4 @ SY8 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(18,plain,
! [SV3: frac,SV1: frac] :
( ( ( ~ ( eq @ SV1 @ SV3 ) )
= $true )
| ( ( eq @ SV3 @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(19,plain,
! [SV5: nat,SV4: nat,SV2: nat] :
( ( eq @ ( fr @ SV2 @ SV4 ) @ ( fr @ ( ts @ SV2 @ SV5 ) @ ( ts @ SV4 @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(20,plain,
! [SV3: frac,SV1: frac] :
( ( ( eq @ SV1 @ SV3 )
= $false )
| ( ( eq @ SV3 @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(21,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,20,19]) ).
thf(22,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM729^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.20 % Computer : n015.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Oct 6 13:39:58 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.24
% 0.09/0.24 No.of.Axioms: 2
% 0.09/0.24
% 0.09/0.24 Length.of.Defs: 0
% 0.09/0.24
% 0.09/0.24 Contains.Choice.Funs: false
% 0.09/0.24
% 0.09/0.24 ********************************
% 0.09/0.24 * All subproblems solved! *
% 0.09/0.24 ********************************
% 0.09/0.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.24
% 0.09/0.24 %**** Beginning of derivation protocol ****
% 0.09/0.24 % SZS output start CNFRefutation
% See solution above
% 0.09/0.24
% 0.09/0.24 %**** End of derivation protocol ****
% 0.09/0.24 %**** no. of clauses in derivation: 22 ****
% 0.09/0.24 %**** clause counter: 21 ****
% 0.09/0.24
% 0.09/0.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------