TSTP Solution File: SYO346^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO346^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 : n008.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:29 EDT 2022
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 52 ( 26 unt; 3 typ; 0 def)
% Number of atoms : 315 ( 92 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 143 ( 61 ~; 52 |; 4 &; 26 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cA,type,
cA: $o ).
thf(tp_cB,type,
cB: $o ).
thf(tp_cP,type,
cP: $o > $o ).
thf(1,conjecture,
( ( cA != cB )
| ~ ( cP @ cA )
| ( cP @ cB ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM621) ).
thf(2,negated_conjecture,
( ( ( cA != cB )
| ~ ( cP @ cA )
| ( cP @ cB ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( cA != cB )
| ~ ( cP @ cA )
| ( cP @ cB ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ( ( cA != cB )
| ~ ( cP @ cA )
| ( cP @ cB ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ~ ( cP @ cB )
& ( cA = cB )
& ( cP @ cA ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ~ ( cP @ cB )
& ( cA = cB )
& ( cP @ cA ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
( ( ~ ( ~ ~ ( cP @ cB )
| ~ ~ ( ( cA != cB )
| ~ ( cP @ cA ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
( ( ~ ~ ( cP @ cB )
| ~ ~ ( ( cA != cB )
| ~ ( cP @ cA ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[7]) ).
thf(9,plain,
( ( ~ ~ ( cP @ cB ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[8]) ).
thf(10,plain,
( ( ~ ~ ( ( cA != cB )
| ~ ( cP @ cA ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( cP @ cB ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( ( cA != cB )
| ~ ( cP @ cA ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( cP @ cB )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ( cA != cB )
| ~ ( cP @ cA ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ( cA != cB ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(16,plain,
( ( ~ ( cP @ cA ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( cA = cB )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(18,plain,
( ( cP @ cA )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ( cA
| cB )
| ~ ( ~ cA
| ~ cB ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[17]) ).
thf(20,plain,
( ( cA = cB )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( ( ~ ( cA
| cB ) )
= $true )
| ( ( ~ ( ~ cA
| ~ cB ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(22,plain,
( ( ( cA
| cB )
= $false )
| ( ( ~ ( ~ cA
| ~ cB ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(23,plain,
( ( cA = $false )
| ( ( ~ ( ~ cA
| ~ cB ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(24,plain,
( ( cB = $false )
| ( ( ~ ( ~ cA
| ~ cB ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(25,plain,
( ( ( ~ cA
| ~ cB )
= $false )
| ( cA = $false ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
( ( ( ~ cA
| ~ cB )
= $false )
| ( cB = $false ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(28,plain,
( ( ( ~ cB )
= $false )
| ( cA = $false ) ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(29,plain,
( ( ( ~ cA )
= $false )
| ( cB = $false ) ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(32,plain,
( ( cB = $true )
| ( cA = $false ) ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(33,plain,
( ( cA = $true )
| ( cB = $false ) ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(37,plain,
( ( ( cP @ cA )
= ( cP @ cB ) )
= $false ),
inference(res,[status(thm)],[18,13]) ).
thf(38,plain,
( ( cA = $true )
| ( cB = $true ) ),
inference(extuni,[status(esa)],[37]) ).
thf(39,plain,
( ( cA = $false )
| ( cB = $false ) ),
inference(extuni,[status(esa)],[37]) ).
thf(41,plain,
( ( cA = $true )
| ( cB = $false ) ),
inference(extcnf_equal_pos,[status(thm)],[20]) ).
thf(42,plain,
( ( cA = $false )
| ( cB = $true ) ),
inference(extcnf_equal_pos,[status(thm)],[20]) ).
thf(57,plain,
( ( ( cB = cB )
= $false )
| ( cA = $true )
| ( cA = $true ) ),
inference(res,[status(thm)],[38,33]) ).
thf(60,plain,
( ( ( cA = cA )
= $false )
| ( cB = $true )
| ( cB = $true ) ),
inference(res,[status(thm)],[38,32]) ).
thf(64,plain,
( ( cB = $true )
| ( cB = $true ) ),
inference(extuni,[status(esa)],[60]) ).
thf(65,plain,
( ( cA = $true )
| ( cA = $true ) ),
inference(extuni,[status(esa)],[57]) ).
thf(66,plain,
cB = $true,
inference(sim,[status(thm)],[64]) ).
thf(67,plain,
cA = $true,
inference(sim,[status(thm)],[65]) ).
thf(73,plain,
( ( ( cA = cA )
= $false )
| ( cB = $false )
| ( cB = $false ) ),
inference(res,[status(thm)],[39,33]) ).
thf(74,plain,
( ( ( cB = cB )
= $false )
| ( cA = $false )
| ( cA = $false ) ),
inference(res,[status(thm)],[39,32]) ).
thf(81,plain,
( ( cA = $false )
| ( cA = $false ) ),
inference(extuni,[status(esa)],[74]) ).
thf(82,plain,
( ( cB = $false )
| ( cB = $false ) ),
inference(extuni,[status(esa)],[73]) ).
thf(85,plain,
cA = $false,
inference(sim,[status(thm)],[81]) ).
thf(86,plain,
cB = $false,
inference(sim,[status(thm)],[82]) ).
thf(87,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[13,86,85,67,66,42,41,39,38,33,32,20,18]) ).
thf(88,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO346^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 16:54:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/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.12/0.41
% 0.12/0.41 ********************************
% 0.12/0.41 * All subproblems solved! *
% 0.12/0.41 ********************************
% 0.12/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (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:87,loop_count:10,foatp_calls:3,translation:fof_full)
% 0.19/0.41
% 0.19/0.41 %**** Beginning of derivation protocol ****
% 0.19/0.41 % SZS output start CNFRefutation
% See solution above
% 0.19/0.41
% 0.19/0.41 %**** End of derivation protocol ****
% 0.19/0.41 %**** no. of clauses in derivation: 49 ****
% 0.19/0.41 %**** clause counter: 87 ****
% 0.19/0.41
% 0.19/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (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:87,loop_count:10,foatp_calls:3,translation:fof_full)
%------------------------------------------------------------------------------