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