TSTP Solution File: SYO348^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO348^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 : n024.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:33:30 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 28 unt; 3 typ; 0 def)
% Number of atoms : 204 ( 53 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 104 ( 35 ~; 28 |; 4 &; 25 @)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 0 ^ 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $o ).
thf(tp_b,type,
b: $o ).
thf(tp_sK1_P,type,
sK1_P: $o > $o ).
thf(1,conjecture,
( ( a
<=> b )
=> ! [P: $o > $o] :
( ( P @ a )
=> ( P @ b ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE1EXT) ).
thf(2,negated_conjecture,
( ( ( a
<=> b )
=> ! [P: $o > $o] :
( ( P @ a )
=> ( P @ b ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( a
<=> b )
=> ! [P: $o > $o] :
( ( P @ a )
=> ( P @ b ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( a
<=> b )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [P: $o > $o] :
( ( P @ a )
=> ( P @ b ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [P: $o > $o] :
( ( P @ a )
=> ( P @ b ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ( sK1_P @ a )
& ~ ( sK1_P @ b ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ( ~ a
| b )
& ( ~ b
| a ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ( ~ a
| b )
& ( ~ b
| a ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ( sK1_P @ a )
& ~ ( sK1_P @ b ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( ~ ( ~ a
| b )
| ~ ( ~ b
| a ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( ~ ( sK1_P @ a )
| ~ ~ ( sK1_P @ b ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ( ~ a
| b )
| ~ ( ~ b
| a ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ( sK1_P @ a )
| ~ ~ ( sK1_P @ b ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( ~ a
| b ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( ~ b
| a ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
( ( ~ ( sK1_P @ a ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(18,plain,
( ( ~ ~ ( sK1_P @ b ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(19,plain,
( ( ~ a
| b )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(20,plain,
( ( ~ b
| a )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(21,plain,
( ( sK1_P @ a )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(22,plain,
( ( ~ ( sK1_P @ b ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(23,plain,
( ( ( ~ a )
= $true )
| ( b = $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(24,plain,
( ( ( ~ b )
= $true )
| ( a = $true ) ),
inference(extcnf_or_pos,[status(thm)],[20]) ).
thf(25,plain,
( ( sK1_P @ b )
= $false ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(26,plain,
( ( a = $false )
| ( b = $true ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(27,plain,
( ( b = $false )
| ( a = $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(28,plain,
( ( ( sK1_P @ b )
= ( sK1_P @ a ) )
= $false ),
inference(res,[status(thm)],[25,21]) ).
thf(29,plain,
( ( b = $true )
| ( a = $true ) ),
inference(extuni,[status(esa)],[28]) ).
thf(30,plain,
( ( b = $false )
| ( a = $false ) ),
inference(extuni,[status(esa)],[28]) ).
thf(44,plain,
( ( ( b = b )
= $false )
| ( a = $true )
| ( a = $true ) ),
inference(res,[status(thm)],[29,27]) ).
thf(51,plain,
( ( a = $true )
| ( a = $true ) ),
inference(extuni,[status(esa)],[44]) ).
thf(53,plain,
a = $true,
inference(sim,[status(thm)],[51]) ).
thf(61,plain,
( ( ( b = b )
= $false )
| ( a = $false )
| ( a = $false ) ),
inference(res,[status(thm)],[30,26]) ).
thf(65,plain,
( ( a = $false )
| ( a = $false ) ),
inference(extuni,[status(esa)],[61]) ).
thf(69,plain,
a = $false,
inference(sim,[status(thm)],[65]) ).
thf(81,plain,
( ( a = a )
= $false ),
inference(res,[status(thm)],[69,53]) ).
thf(84,plain,
$false = $true,
inference(extuni,[status(esa)],[81]) ).
thf(85,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO348^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 02:52:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 0
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.34 (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.19/0.37
% 0.19/0.37 ********************************
% 0.19/0.37 * All subproblems solved! *
% 0.19/0.37 ********************************
% 0.19/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:84,loop_count:9,foatp_calls:1,translation:fof_full)
% 0.19/0.37
% 0.19/0.37 %**** Beginning of derivation protocol ****
% 0.19/0.37 % SZS output start CNFRefutation
% See solution above
% 0.19/0.37
% 0.19/0.37 %**** End of derivation protocol ****
% 0.19/0.37 %**** no. of clauses in derivation: 39 ****
% 0.19/0.37 %**** clause counter: 84 ****
% 0.19/0.37
% 0.19/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:84,loop_count:9,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------