%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SET045^5 : TPTP v9.3.1. Released v4.0.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 : 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:39:07 AM UTC 2026
% Result : Theorem 0.07s 0.19s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 22 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 21 ( 9 ~; 0 |; 0 &; 12 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 ^; 16 !; 5 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_b,type,
b: $tType ).
thf(tp_cA,type,
cA: b ).
thf(tp_sK1_SY2,type,
sK1_SY2: ( a > b ) > a ).
thf(1,conjecture,
? [U: a > b] :
! [V: a] :
( ( U @ V )
= cA ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTTTP5243) ).
thf(2,negated_conjecture,
( ( ? [U: a > b] :
! [V: a] :
( ( U @ V )
= cA ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [U: a > b] :
! [V: a] :
( ( U @ V )
= cA ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ? [U: a > b] :
! [V: a] :
( ( U @ V )
= cA ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ~ ? [U: a > b] :
! [V: a] :
( ( U @ V )
= cA ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(6,plain,
( ( ~ ~ ! [SX0: a > b] :
~ ! [SX1: a] :
( ( SX0 @ SX1 )
= cA ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ~ ! [SX0: a > b] :
~ ! [SX1: a] :
( ( SX0 @ SX1 )
= cA ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [SX0: a > b] :
~ ! [SX1: a] :
( ( SX0 @ SX1 )
= cA ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[7]) ).
thf(9,plain,
! [SV1: a > b] :
( ( ~ ! [SY2: a] :
( ( SV1 @ SY2 )
= cA ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[8]) ).
thf(10,plain,
! [SV1: a > b] :
( ( ! [SY2: a] :
( ( SV1 @ SY2 )
= cA ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(11,plain,
! [SV1: a > b] :
( ( ( SV1 @ ( sK1_SY2 @ SV1 ) )
= cA )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[10]) ).
thf(12,plain,
$false = $true,
inference(extuni,[status(esa)],[11:[bind(SV1,$thf( ^ [SX0: a] : cA ))]]) ).
thf(13,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET045^5 : TPTP v9.3.1. Released v4.0.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.07/0.17 % Computer : n006.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Oct 6 14:28:52 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 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.07/0.19
% 0.07/0.19 No.of.Axioms: 0
% 0.07/0.19
% 0.07/0.19 Length.of.Defs: 0
% 0.07/0.19
% 0.07/0.19 Contains.Choice.Funs: false
% 0.07/0.19
% 0.07/0.19 ********************************
% 0.07/0.19 * All subproblems solved! *
% 0.07/0.19 ********************************
% 0.07/0.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,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:12,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.19
% 0.07/0.19 %**** Beginning of derivation protocol ****
% 0.07/0.19 % SZS output start CNFRefutation
% See solution above
% 0.07/0.19
% 0.07/0.19 %**** End of derivation protocol ****
% 0.07/0.19 %**** no. of clauses in derivation: 13 ****
% 0.07/0.19 %**** clause counter: 12 ****
% 0.07/0.19
% 0.07/0.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,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:12,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------