%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM771^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/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:11 AM UTC 2026
% Result : Theorem 0.10s 0.21s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 43 ( 18 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 162 ( 2 ~; 0 |; 0 &; 160 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_frac,type,
frac: $tType ).
thf(tp_nat,type,
nat: $tType ).
thf(tp_den,type,
den: frac > nat ).
thf(tp_eq,type,
eq: frac > frac > $o ).
thf(tp_fr,type,
fr: nat > nat > frac ).
thf(tp_num,type,
num: frac > nat ).
thf(tp_ts,type,
ts: nat > nat > nat ).
thf(tp_x,type,
x: frac ).
thf(tp_y,type,
y: frac ).
thf(1,axiom,
! [Xx: nat,Xy: nat] :
( ( ts @ Xx @ Xy )
= ( ts @ Xy @ Xx ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz29) ).
thf(2,axiom,
! [Xx: frac] : ( eq @ Xx @ Xx ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
thf(3,conjecture,
eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz69) ).
thf(4,negated_conjecture,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( ts @ Xx @ Xy )
= ( ts @ Xy @ Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(7,plain,
( ( ! [Xx: frac] : ( eq @ Xx @ Xx ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(8,plain,
( ( ~ ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(9,plain,
( ( ! [Xx: frac] : ( eq @ Xx @ Xx ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( ts @ Xx @ Xy )
= ( ts @ Xy @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(11,plain,
( ( ~ ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,plain,
! [SV1: frac] :
( ( eq @ SV1 @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(13,plain,
! [SV2: nat] :
( ( ! [SY3: nat] :
( ( ts @ SV2 @ SY3 )
= ( ts @ SY3 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(14,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(15,plain,
! [SV3: nat,SV2: nat] :
( ( ( ts @ SV2 @ SV3 )
= ( ts @ SV3 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(16,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,15,14]) ).
thf(17,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM771^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/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.17 % Computer : n003.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Oct 6 13:40:24 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/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.10/0.21
% 0.10/0.21 No.of.Axioms: 2
% 0.10/0.21
% 0.10/0.21 Length.of.Defs: 0
% 0.10/0.21
% 0.10/0.21 Contains.Choice.Funs: false
% 0.10/0.21
% 0.10/0.21 ********************************
% 0.10/0.21 * All subproblems solved! *
% 0.10/0.21 ********************************
% 0.10/0.21 % SZS status Theorem for /export/starexec/sandbox/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:16,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 0.10/0.21
% 0.10/0.21 %**** Beginning of derivation protocol ****
% 0.10/0.21 % SZS output start CNFRefutation
% See solution above
% 0.10/0.21
% 0.10/0.21 %**** End of derivation protocol ****
% 0.10/0.21 %**** no. of clauses in derivation: 17 ****
% 0.10/0.21 %**** clause counter: 16 ****
% 0.10/0.21
% 0.10/0.21 % SZS status Theorem for /export/starexec/sandbox/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:16,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------