%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SEV228^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 : n017.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:49:47 AM UTC 2026
% Result : Theorem 0.10s 0.27s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 84 ( 30 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 143 ( 33 ~; 17 |; 8 &; 75 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 22 !; 6 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_cS,type,
cS: a > $o ).
thf(tp_sK1_Xx,type,
sK1_Xx: a ).
thf(tp_sK2_Xx0,type,
sK2_Xx0: ( a > $o ) > a ).
thf(1,conjecture,
! [Xx: a] :
( ( cS @ Xx )
=> ? [S_11: a > $o] :
( ! [Xx0: a] :
( ( S_11 @ Xx0 )
=> ( cS @ Xx0 ) )
& ( S_11 @ Xx ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM91A_pme) ).
thf(2,negated_conjecture,
( ( ! [Xx: a] :
( ( cS @ Xx )
=> ? [S_11: a > $o] :
( ! [Xx0: a] :
( ( S_11 @ Xx0 )
=> ( cS @ Xx0 ) )
& ( S_11 @ Xx ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: a] :
( ( cS @ Xx )
=> ? [S_11: a > $o] :
( ! [Xx0: a] :
( ( S_11 @ Xx0 )
=> ( cS @ Xx0 ) )
& ( S_11 @ Xx ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( cS @ sK1_Xx )
=> ? [SY3: a > $o] :
( ! [Xx0: a] :
( ( SY3 @ Xx0 )
=> ( cS @ Xx0 ) )
& ( SY3 @ sK1_Xx ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( cS @ sK1_Xx )
= $true ),
inference(standard_cnf,[status(thm)],[4]) ).
thf(6,plain,
( ( ? [SY3: a > $o] :
( ! [Xx0: a] :
( ( SY3 @ Xx0 )
=> ( cS @ Xx0 ) )
& ( SY3 @ sK1_Xx ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[4]) ).
thf(7,plain,
( ( ~ ? [SY3: a > $o] :
( ! [Xx0: a] :
( ( SY3 @ Xx0 )
=> ( cS @ Xx0 ) )
& ( SY3 @ sK1_Xx ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [SY3: a > $o] :
( ( ( SY3 @ ( sK2_Xx0 @ SY3 ) )
& ~ ( cS @ ( sK2_Xx0 @ SY3 ) ) )
| ~ ( SY3 @ sK1_Xx ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(9,plain,
( ( cS @ sK1_Xx )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(10,plain,
( ( ! [SY3: a > $o] :
( ( ( SY3 @ ( sK2_Xx0 @ SY3 ) )
& ~ ( cS @ ( sK2_Xx0 @ SY3 ) ) )
| ~ ( SY3 @ sK1_Xx ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ! [SX0: a > $o] :
( ~ ( ~ ( SX0 @ ( sK2_Xx0 @ SX0 ) )
| ~ ~ ( cS @ ( sK2_Xx0 @ SX0 ) ) )
| ~ ( SX0 @ sK1_Xx ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
! [SV1: a > $o] :
( ( ~ ( ~ ( SV1 @ ( sK2_Xx0 @ SV1 ) )
| ~ ~ ( cS @ ( sK2_Xx0 @ SV1 ) ) )
| ~ ( SV1 @ sK1_Xx ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(13,plain,
! [SV1: a > $o] :
( ( ( ~ ( ~ ( SV1 @ ( sK2_Xx0 @ SV1 ) )
| ~ ~ ( cS @ ( sK2_Xx0 @ SV1 ) ) ) )
= $true )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[12]) ).
thf(14,plain,
! [SV1: a > $o] :
( ( ( ~ ( SV1 @ ( sK2_Xx0 @ SV1 ) )
| ~ ~ ( cS @ ( sK2_Xx0 @ SV1 ) ) )
= $false )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(15,plain,
! [SV1: a > $o] :
( ( ( ~ ( SV1 @ ( sK2_Xx0 @ SV1 ) ) )
= $false )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(16,plain,
! [SV1: a > $o] :
( ( ( ~ ~ ( cS @ ( sK2_Xx0 @ SV1 ) ) )
= $false )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(17,plain,
! [SV1: a > $o] :
( ( ( SV1 @ ( sK2_Xx0 @ SV1 ) )
= $true )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(18,plain,
! [SV1: a > $o] :
( ( ( ~ ( cS @ ( sK2_Xx0 @ SV1 ) ) )
= $true )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(19,plain,
! [SV1: a > $o] :
( ( ( SV1 @ sK1_Xx )
= $false )
| ( ( SV1 @ ( sK2_Xx0 @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(20,plain,
! [SV1: a > $o] :
( ( ( cS @ ( sK2_Xx0 @ SV1 ) )
= $false )
| ( ( ~ ( SV1 @ sK1_Xx ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(21,plain,
! [SV1: a > $o] :
( ( ( SV1 @ sK1_Xx )
= $false )
| ( ( cS @ ( sK2_Xx0 @ SV1 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(22,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[9,21,19]) ).
thf(23,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV228^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % 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.10/0.24 % Computer : n017.cluster.edu
% 0.10/0.24 % Model : x86_64 x86_64
% 0.10/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.24 % Memory : 8046.5625MB
% 0.10/0.24 % OS : Linux 6.8.0-71-generic
% 0.10/0.24 % CPULimit : 300
% 0.10/0.24 % WCLimit : 300
% 0.10/0.24 % DateTime : Tue Oct 6 15:39:01 UTC 2026
% 0.10/0.24 % CPUTime :
% 0.10/0.24 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.10/0.27
% 0.10/0.27 No.of.Axioms: 0
% 0.10/0.27
% 0.10/0.27 Length.of.Defs: 0
% 0.10/0.27
% 0.10/0.27 Contains.Choice.Funs: false
% 0.10/0.27
% 0.10/0.27 ********************************
% 0.10/0.27 * All subproblems solved! *
% 0.10/0.27 ********************************
% 0.10/0.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.27
% 0.10/0.27 %**** Beginning of derivation protocol ****
% 0.10/0.27 % SZS output start CNFRefutation
% See solution above
% 0.10/0.28
% 0.10/0.28 %**** End of derivation protocol ****
% 0.10/0.28 %**** no. of clauses in derivation: 23 ****
% 0.10/0.28 %**** clause counter: 22 ****
% 0.10/0.28
% 0.10/0.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:22,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------