TSTP Solution File: SEV285^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV285^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n021.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 : Tue Jul 19 17:36:02 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 52 ( 35 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 27 ( 2 ~; 0 |; 0 &; 20 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 ^ 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_b,type,
b: $tType ).
thf(tp_sK1_F,type,
sK1_F: a > b ).
thf(tp_sK2_SY3,type,
sK2_SY3: a > b ).
thf(tp_sK3_SV2,type,
sK3_SV2: a ).
thf(1,conjecture,
! [F: a > b,G: a > b] :
( ! [A: a] :
( ( F @ A )
= ( G @ A ) )
=> ( F = G ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEE_eq_) ).
thf(2,negated_conjecture,
( ( ! [F: a > b,G: a > b] :
( ! [A: a] :
( ( F @ A )
= ( G @ A ) )
=> ( F = G ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [F: a > b,G: a > b] :
( ! [A: a] :
( ( F @ A )
= ( G @ A ) )
=> ( F = G ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY3: a > b] :
( ! [SY4: a] :
( ( sK1_F @ SY4 )
= ( SY3 @ SY4 ) )
=> ( sK1_F = SY3 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY5: a] :
( ( sK1_F @ SY5 )
= ( sK2_SY3 @ SY5 ) )
=> ( sK1_F = sK2_SY3 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [SY5: a] :
( ( sK1_F @ SY5 )
= ( sK2_SY3 @ SY5 ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(7,plain,
( ( sK1_F = sK2_SY3 )
= $false ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(8,plain,
( ( ( sK1_F != sK2_SY3 ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [SY5: a] :
( ( sK1_F @ SY5 )
= ( sK2_SY3 @ SY5 ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(10,plain,
( ( ( sK1_F != sK2_SY3 ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
! [SV1: a] :
( ( ( sK1_F @ SV1 )
= ( sK2_SY3 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(12,plain,
( ( sK1_F = sK2_SY3 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [SV2: a] :
( ( sK1_F @ SV2 )
= ( sK2_SY3 @ SV2 ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[12]) ).
thf(14,plain,
( ( sK1_F = sK2_SY3 )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( ( sK1_F @ sK3_SV2 )
= ( sK2_SY3 @ sK3_SV2 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[13]) ).
thf(16,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[11,15,14]) ).
thf(17,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV285^5 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 28 17:33:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 0
% 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:0,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:2,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.13/0.38 ********************************
% 0.13/0.38 * All subproblems solved! *
% 0.13/0.38 ********************************
% 0.13/0.38 % SZS status Theorem for /export/starexec/sandbox/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:16,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38
% 0.13/0.38 %**** Beginning of derivation protocol ****
% 0.13/0.38 % SZS output start CNFRefutation
% See solution above
% 0.13/0.38
% 0.13/0.38 %**** End of derivation protocol ****
% 0.13/0.38 %**** no. of clauses in derivation: 17 ****
% 0.13/0.38 %**** clause counter: 16 ****
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for /export/starexec/sandbox/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:16,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------