%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : NUM761^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 : n002.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:09 AM UTC 2026
% Result : Theorem 0.11s 0.22s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 61 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 279 ( 81 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 458 ( 74 ~; 56 |; 0 &; 310 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 105 ( 0 ^; 105 !; 0 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_frac,type,
frac: $tType ).
thf(tp_eq,type,
eq: frac > frac > $o ).
thf(tp_moref,type,
moref: frac > frac > $o ).
thf(tp_pf,type,
pf: frac > frac > frac ).
thf(tp_u,type,
u: frac ).
thf(tp_x,type,
x: frac ).
thf(tp_y,type,
y: frac ).
thf(tp_z,type,
z: frac ).
thf(1,axiom,
! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( moref @ Xx @ Xy )
=> ( ( moref @ Xz @ Xu )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz64) ).
thf(2,axiom,
! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( eq @ Xx @ Xy )
=> ( ( moref @ Xz @ Xu )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz62g) ).
thf(3,axiom,
! [Xa: $o] :
( ~ ~ Xa
=> Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',et) ).
thf(4,axiom,
moref @ z @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
thf(5,axiom,
( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(6,conjecture,
moref @ ( pf @ x @ z ) @ ( pf @ y @ u ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz65a) ).
thf(7,negated_conjecture,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $false ),
inference(negate_conjecture,[status(cth)],[6]) ).
thf(8,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $false ),
inference(unfold_def,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( moref @ Xx @ Xy )
=> ( ( moref @ Xz @ Xu )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(10,plain,
( ( ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( eq @ Xx @ Xy )
=> ( ( moref @ Xz @ Xu )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(11,plain,
( ( ! [Xa: $o] :
( ~ ~ Xa
=> Xa ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(12,plain,
( ( moref @ z @ u )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(13,plain,
( ( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(14,plain,
( ( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(15,plain,
( ( ~ ( moref @ x @ y )
=> ( eq @ x @ y ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(16,plain,
( ( moref @ z @ u )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(17,plain,
( ( ! [Xa: $o] :
( ~ ~ Xa
=> Xa ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(18,plain,
( ( ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( eq @ Xx @ Xy )
=> ( ( moref @ Xz @ Xu )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(19,plain,
( ( ! [Xx: frac,Xy: frac,Xz: frac,Xu: frac] :
( ( moref @ Xx @ Xy )
=> ( ( moref @ Xz @ Xu )
=> ( moref @ ( pf @ Xx @ Xz ) @ ( pf @ Xy @ Xu ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(20,plain,
( ( ~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(21,plain,
( ( ~ ~ ( moref @ x @ y )
| ( eq @ x @ y ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(22,plain,
( ( ! [SX0: $o] :
( ~ ~ ~ SX0
| SX0 ) )
= $true ),
inference(unfold_def,[status(thm)],[17]) ).
thf(23,plain,
( ( ! [SX0: frac,SX1: frac,SX2: frac,SX3: frac] :
( ~ ( moref @ SX0 @ SX1 )
| ~ ( moref @ SX2 @ SX3 )
| ( moref @ ( pf @ SX0 @ SX2 ) @ ( pf @ SX1 @ SX3 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[19]) ).
thf(24,plain,
( ( ! [SX0: frac,SX1: frac,SX2: frac,SX3: frac] :
( ~ ( eq @ SX0 @ SX1 )
| ~ ( moref @ SX2 @ SX3 )
| ( moref @ ( pf @ SX0 @ SX2 ) @ ( pf @ SX1 @ SX3 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[18]) ).
thf(25,plain,
( ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(26,plain,
( ( ( ~ ~ ( moref @ x @ y ) )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(27,plain,
! [SV1: $o] :
( ( ~ ~ ~ SV1
| SV1 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[22]) ).
thf(28,plain,
( ( ~ ~ ~ $true
| $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[22]) ).
thf(29,plain,
( ( ~ ~ ~ $false
| $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[22]) ).
thf(30,plain,
! [SV2: frac] :
( ( ! [SY9: frac,SY10: frac,SY11: frac] :
( ~ ( moref @ SV2 @ SY9 )
| ~ ( moref @ SY10 @ SY11 )
| ( moref @ ( pf @ SV2 @ SY10 ) @ ( pf @ SY9 @ SY11 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(31,plain,
! [SV3: frac] :
( ( ! [SY12: frac,SY13: frac,SY14: frac] :
( ~ ( eq @ SV3 @ SY12 )
| ~ ( moref @ SY13 @ SY14 )
| ( moref @ ( pf @ SV3 @ SY13 ) @ ( pf @ SY12 @ SY14 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(32,plain,
( ( ( ~ ( moref @ x @ y ) )
= $false )
| ( ( eq @ x @ y )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(33,plain,
! [SV1: $o] :
( ( ( ~ ~ ~ SV1 )
= $true )
| ( SV1 = $true ) ),
inference(extcnf_or_pos,[status(thm)],[27]) ).
thf(34,plain,
( ( ( ~ ~ ~ $true )
= $true )
| ( $true = $true ) ),
inference(extcnf_or_pos,[status(thm)],[28]) ).
thf(35,plain,
( ( ( ~ ~ ~ $false )
= $true )
| ( $false = $true ) ),
inference(extcnf_or_pos,[status(thm)],[29]) ).
thf(36,plain,
! [SV4: frac,SV2: frac] :
( ( ! [SY15: frac,SY16: frac] :
( ~ ( moref @ SV2 @ SV4 )
| ~ ( moref @ SY15 @ SY16 )
| ( moref @ ( pf @ SV2 @ SY15 ) @ ( pf @ SV4 @ SY16 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(37,plain,
! [SV5: frac,SV3: frac] :
( ( ! [SY17: frac,SY18: frac] :
( ~ ( eq @ SV3 @ SV5 )
| ~ ( moref @ SY17 @ SY18 )
| ( moref @ ( pf @ SV3 @ SY17 ) @ ( pf @ SV5 @ SY18 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(38,plain,
( ( ( moref @ x @ y )
= $true )
| ( ( eq @ x @ y )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[32]) ).
thf(39,plain,
! [SV1: $o] :
( ( ( ~ ~ SV1 )
= $false )
| ( SV1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(40,plain,
( ( ( ~ ~ $true )
= $false )
| ( $true = $true ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(41,plain,
( ( ( ~ ~ $false )
= $false )
| ( $false = $true ) ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(42,plain,
! [SV6: frac,SV4: frac,SV2: frac] :
( ( ! [SY19: frac] :
( ~ ( moref @ SV2 @ SV4 )
| ~ ( moref @ SV6 @ SY19 )
| ( moref @ ( pf @ SV2 @ SV6 ) @ ( pf @ SV4 @ SY19 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[36]) ).
thf(43,plain,
! [SV7: frac,SV5: frac,SV3: frac] :
( ( ! [SY20: frac] :
( ~ ( eq @ SV3 @ SV5 )
| ~ ( moref @ SV7 @ SY20 )
| ( moref @ ( pf @ SV3 @ SV7 ) @ ( pf @ SV5 @ SY20 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(44,plain,
! [SV1: $o] :
( ( ( ~ SV1 ) = $true )
| ( SV1 = $true ) ),
inference(extcnf_not_neg,[status(thm)],[39]) ).
thf(45,plain,
( ( ( ~ $true ) = $true )
| ( $true = $true ) ),
inference(extcnf_not_neg,[status(thm)],[40]) ).
thf(46,plain,
( ( ( ~ $false ) = $true )
| ( $false = $true ) ),
inference(extcnf_not_neg,[status(thm)],[41]) ).
thf(47,plain,
! [SV8: frac,SV6: frac,SV4: frac,SV2: frac] :
( ( ~ ( moref @ SV2 @ SV4 )
| ~ ( moref @ SV6 @ SV8 )
| ( moref @ ( pf @ SV2 @ SV6 ) @ ( pf @ SV4 @ SV8 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[42]) ).
thf(48,plain,
! [SV9: frac,SV7: frac,SV5: frac,SV3: frac] :
( ( ~ ( eq @ SV3 @ SV5 )
| ~ ( moref @ SV7 @ SV9 )
| ( moref @ ( pf @ SV3 @ SV7 ) @ ( pf @ SV5 @ SV9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[43]) ).
thf(49,plain,
! [SV1: $o] :
( ( SV1 = $false )
| ( SV1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[44]) ).
thf(50,plain,
( ( $true = $false )
| ( $true = $true ) ),
inference(extcnf_not_pos,[status(thm)],[45]) ).
thf(51,plain,
( ( $false = $false )
| ( $false = $true ) ),
inference(extcnf_not_pos,[status(thm)],[46]) ).
thf(52,plain,
! [SV8: frac,SV6: frac,SV4: frac,SV2: frac] :
( ( ( ~ ( moref @ SV2 @ SV4 ) )
= $true )
| ( ( ~ ( moref @ SV6 @ SV8 )
| ( moref @ ( pf @ SV2 @ SV6 ) @ ( pf @ SV4 @ SV8 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(53,plain,
! [SV9: frac,SV7: frac,SV5: frac,SV3: frac] :
( ( ( ~ ( eq @ SV3 @ SV5 ) )
= $true )
| ( ( ~ ( moref @ SV7 @ SV9 )
| ( moref @ ( pf @ SV3 @ SV7 ) @ ( pf @ SV5 @ SV9 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[48]) ).
thf(54,plain,
! [SV8: frac,SV6: frac,SV4: frac,SV2: frac] :
( ( ( moref @ SV2 @ SV4 )
= $false )
| ( ( ~ ( moref @ SV6 @ SV8 )
| ( moref @ ( pf @ SV2 @ SV6 ) @ ( pf @ SV4 @ SV8 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[52]) ).
thf(55,plain,
! [SV9: frac,SV7: frac,SV5: frac,SV3: frac] :
( ( ( eq @ SV3 @ SV5 )
= $false )
| ( ( ~ ( moref @ SV7 @ SV9 )
| ( moref @ ( pf @ SV3 @ SV7 ) @ ( pf @ SV5 @ SV9 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[53]) ).
thf(56,plain,
! [SV4: frac,SV2: frac,SV8: frac,SV6: frac] :
( ( ( ~ ( moref @ SV6 @ SV8 ) )
= $true )
| ( ( moref @ ( pf @ SV2 @ SV6 ) @ ( pf @ SV4 @ SV8 ) )
= $true )
| ( ( moref @ SV2 @ SV4 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[54]) ).
thf(57,plain,
! [SV5: frac,SV3: frac,SV9: frac,SV7: frac] :
( ( ( ~ ( moref @ SV7 @ SV9 ) )
= $true )
| ( ( moref @ ( pf @ SV3 @ SV7 ) @ ( pf @ SV5 @ SV9 ) )
= $true )
| ( ( eq @ SV3 @ SV5 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[55]) ).
thf(58,plain,
! [SV4: frac,SV2: frac,SV8: frac,SV6: frac] :
( ( ( moref @ SV6 @ SV8 )
= $false )
| ( ( moref @ ( pf @ SV2 @ SV6 ) @ ( pf @ SV4 @ SV8 ) )
= $true )
| ( ( moref @ SV2 @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(59,plain,
! [SV5: frac,SV3: frac,SV9: frac,SV7: frac] :
( ( ( moref @ SV7 @ SV9 )
= $false )
| ( ( moref @ ( pf @ SV3 @ SV7 ) @ ( pf @ SV5 @ SV9 ) )
= $true )
| ( ( eq @ SV3 @ SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[57]) ).
thf(60,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,59,58,51,50,49,38,25]) ).
thf(61,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM761^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.11/0.17 % Computer : n002.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Oct 6 13:40:42 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 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.11/0.22
% 0.11/0.22 No.of.Axioms: 5
% 0.11/0.22
% 0.11/0.22 Length.of.Defs: 0
% 0.11/0.22
% 0.11/0.22 Contains.Choice.Funs: false
% 0.11/0.22 .
% 0.11/0.22
% 0.11/0.22 ********************************
% 0.11/0.22 * All subproblems solved! *
% 0.11/0.22 ********************************
% 0.11/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:5,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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:60,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.11/0.22
% 0.11/0.22 %**** Beginning of derivation protocol ****
% 0.11/0.22 % SZS output start CNFRefutation
% See solution above
% 0.11/0.22
% 0.11/0.22 %**** End of derivation protocol ****
% 0.11/0.22 %**** no. of clauses in derivation: 61 ****
% 0.11/0.22 %**** clause counter: 60 ****
% 0.11/0.22
% 0.11/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:5,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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:60,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------