TSTP Solution File: SYO527^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO527^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 17:35:22 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 15 unt; 5 typ; 0 def)
% Number of atoms : 39 ( 12 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 49 ( 4 ~; 0 |; 0 &; 45 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 13 !; 6 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_b,type,
b: $tType ).
thf(tp_r,type,
r: a > b > $o ).
thf(tp_sK1_X,type,
sK1_X: ( a > b ) > a ).
thf(tp_sK2_Y,type,
sK2_Y: a > b ).
thf(1,axiom,
! [X: a] :
? [Y: b] : ( r @ X @ Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rtotal) ).
thf(2,conjecture,
? [F: a > b] :
! [X: a] : ( r @ X @ ( F @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',skolem) ).
thf(3,negated_conjecture,
( ( ? [F: a > b] :
! [X: a] : ( r @ X @ ( F @ X ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[2]) ).
thf(4,plain,
( ( ? [F: a > b] :
! [X: a] : ( r @ X @ ( F @ X ) ) )
= $false ),
inference(unfold_def,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [X: a] :
? [Y: b] : ( r @ X @ Y ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(6,plain,
( ( ~ ? [F: a > b] :
! [X: a] : ( r @ X @ ( F @ X ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ! [F: a > b] :
~ ( r @ ( sK1_X @ F ) @ ( F @ ( sK1_X @ F ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [X: a] : ( r @ X @ ( sK2_Y @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(9,plain,
( ( ! [X: a] : ( r @ X @ ( sK2_Y @ X ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [F: a > b] :
~ ( r @ ( sK1_X @ F ) @ ( F @ ( sK1_X @ F ) ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
! [SV1: a] :
( ( r @ SV1 @ ( sK2_Y @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(12,plain,
! [SV2: a > b] :
( ( ~ ( r @ ( sK1_X @ SV2 ) @ ( SV2 @ ( sK1_X @ SV2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
! [SV2: a > b] :
( ( r @ ( sK1_X @ SV2 ) @ ( SV2 @ ( sK1_X @ SV2 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(14,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[11,13]) ).
thf(15,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO527^1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 09:38:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 1
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:3,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.13/0.37 ********************************
% 0.13/0.37 * All subproblems solved! *
% 0.13/0.37 ********************************
% 0.13/0.37 % 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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.37
% 0.13/0.37 %**** Beginning of derivation protocol ****
% 0.13/0.37 % SZS output start CNFRefutation
% See solution above
% 0.13/0.37
% 0.13/0.37 %**** End of derivation protocol ****
% 0.13/0.37 %**** no. of clauses in derivation: 15 ****
% 0.13/0.37 %**** clause counter: 14 ****
% 0.13/0.37
% 0.13/0.37 % 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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:14,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------