TSTP Solution File: SYO134^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO134^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 : n029.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:32:21 EDT 2022
% Result : Theorem 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 14 unt; 3 typ; 0 def)
% Number of atoms : 71 ( 19 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 51 ( 5 ~; 5 |; 0 &; 31 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 ^ 15 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_cP,type,
cP: $i > $o ).
thf(tp_cQ,type,
cQ: $i > $o ).
thf(1,conjecture,
( ( ( cP @ a )
=> ! [Xx: $i] : ( cQ @ Xx ) )
=> ( ! [Xx: $i] : ( cP @ Xx )
=> ( cQ @ a ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cADDHYP1) ).
thf(2,negated_conjecture,
( ( ( ( cP @ a )
=> ! [Xx: $i] : ( cQ @ Xx ) )
=> ( ! [Xx: $i] : ( cP @ Xx )
=> ( cQ @ a ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( cP @ a )
=> ! [Xx: $i] : ( cQ @ Xx ) )
=> ( ! [Xx: $i] : ( cP @ Xx )
=> ( cQ @ a ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( cP @ a )
=> ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( cQ @ a )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ( cQ @ a ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ~ ( cP @ a )
| ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [Xx: $i] : ( cP @ Xx ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(10,plain,
( ( ~ ( cP @ a )
| ! [Xx: $i] : ( cQ @ Xx ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( cQ @ a ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(12,plain,
! [SV1: $i] :
( ( cP @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(13,plain,
( ( ( ~ ( cP @ a ) )
= $true )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[10]) ).
thf(14,plain,
( ( cQ @ a )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(15,plain,
( ( ( cP @ a )
= $false )
| ( ( ! [Xx: $i] : ( cQ @ Xx ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(16,plain,
! [SV2: $i] :
( ( ( cQ @ SV2 )
= $true )
| ( ( cP @ a )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(17,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,16,14]) ).
thf(18,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO134^5 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n029.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 13:32:15 EDT 2022
% 0.13/0.34 % 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.20/0.37 ********************************
% 0.20/0.37 * All subproblems solved! *
% 0.20/0.37 ********************************
% 0.20/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:17,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.37
% 0.20/0.37 %**** Beginning of derivation protocol ****
% 0.20/0.37 % SZS output start CNFRefutation
% See solution above
% 0.20/0.37
% 0.20/0.37 %**** End of derivation protocol ****
% 0.20/0.37 %**** no. of clauses in derivation: 18 ****
% 0.20/0.37 %**** clause counter: 17 ****
% 0.20/0.37
% 0.20/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:17,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------