TSTP Solution File: SYN044+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN044+1 : TPTP v8.1.0. Released v2.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 08:22:51 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 76 ( 51 unt; 3 typ; 0 def)
% Number of atoms : 336 ( 88 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 165 ( 78 ~; 65 |; 9 &; 0 @)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_p,type,
p: $o ).
thf(tp_q,type,
q: $o ).
thf(tp_r,type,
r: $o ).
thf(1,axiom,
( p
=> ( q
| r ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10_3) ).
thf(2,axiom,
( r
=> ( p
& q ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10_2) ).
thf(3,axiom,
( q
=> r ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10_1) ).
thf(4,conjecture,
( p
<=> q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10) ).
thf(5,negated_conjecture,
( ( p
<=> q )
= $false ),
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,plain,
( ( p
<=> q )
= $false ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( p
=> ( q
| r ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( r
=> ( p
& q ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( q
=> r )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(10,plain,
( ( p
=> q )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[6]) ).
thf(11,plain,
( ( q
=> p )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[6]) ).
thf(12,plain,
( ( ~ ( p
=> q ) )
= $true ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ( q
=> p ) )
= $true ),
inference(polarity_switch,[status(thm)],[11]) ).
thf(14,plain,
( ( p
& ~ q )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(15,plain,
( ( q
& ~ p )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(16,plain,
( ( ~ p
| q
| r )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(17,plain,
( ( ( ~ r
| p )
& ( ~ r
| q ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(18,plain,
( ( ~ q
| r )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(19,plain,
( ( ~ q
| r )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(20,plain,
( ( ( ~ r
| p )
& ( ~ r
| q ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(21,plain,
( ( ~ p
| q
| r )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(22,plain,
( ( p
& ~ q )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(23,plain,
( ( ~ ( ~ ( ~ r
| p )
| ~ ( ~ r
| q ) ) )
= $true ),
inference(unfold_def,[status(thm)],[20]) ).
thf(24,plain,
( ( ~ ( ~ p
| ~ ~ q ) )
= $true ),
inference(unfold_def,[status(thm)],[22]) ).
thf(25,plain,
( ( ( ~ q )
= $true )
| ( r = $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(26,plain,
( ( ( ~ p )
= $true )
| ( ( q
| r )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(27,plain,
( ( ~ ( ~ r
| p )
| ~ ( ~ r
| q ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(28,plain,
( ( ~ p
| ~ ~ q )
= $false ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(29,plain,
( ( q = $false )
| ( r = $true ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(30,plain,
( ( p = $false )
| ( ( q
| r )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(31,plain,
( ( ~ ( ~ r
| p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(32,plain,
( ( ~ ( ~ r
| q ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(33,plain,
( ( ~ p )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(34,plain,
( ( ~ ~ q )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(35,plain,
( ( q = $true )
| ( r = $true )
| ( p = $false ) ),
inference(extcnf_or_pos,[status(thm)],[30]) ).
thf(36,plain,
( ( ~ r
| p )
= $true ),
inference(extcnf_not_neg,[status(thm)],[31]) ).
thf(37,plain,
( ( ~ r
| q )
= $true ),
inference(extcnf_not_neg,[status(thm)],[32]) ).
thf(38,plain,
p = $true,
inference(extcnf_not_neg,[status(thm)],[33]) ).
thf(39,plain,
( ( ~ q )
= $true ),
inference(extcnf_not_neg,[status(thm)],[34]) ).
thf(40,plain,
( ( ( ~ r )
= $true )
| ( p = $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(41,plain,
( ( ( ~ r )
= $true )
| ( q = $true ) ),
inference(extcnf_or_pos,[status(thm)],[37]) ).
thf(42,plain,
q = $false,
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(43,plain,
( ( r = $false )
| ( p = $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(44,plain,
( ( r = $false )
| ( q = $true ) ),
inference(extcnf_not_pos,[status(thm)],[41]) ).
thf(45,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[29,44,43,42,38,35]) ).
thf(46,plain,
( ( ~ q
| r )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(47,plain,
( ( ( ~ r
| p )
& ( ~ r
| q ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(48,plain,
( ( ~ p
| q
| r )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(49,plain,
( ( q
& ~ p )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(50,plain,
( ( ~ ( ~ ( ~ r
| p )
| ~ ( ~ r
| q ) ) )
= $true ),
inference(unfold_def,[status(thm)],[47]) ).
thf(51,plain,
( ( ~ ( ~ q
| ~ ~ p ) )
= $true ),
inference(unfold_def,[status(thm)],[49]) ).
thf(52,plain,
( ( ( ~ q )
= $true )
| ( r = $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(53,plain,
( ( ( ~ p )
= $true )
| ( ( q
| r )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[48]) ).
thf(54,plain,
( ( ~ ( ~ r
| p )
| ~ ( ~ r
| q ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(55,plain,
( ( ~ q
| ~ ~ p )
= $false ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(56,plain,
( ( q = $false )
| ( r = $true ) ),
inference(extcnf_not_pos,[status(thm)],[52]) ).
thf(57,plain,
( ( p = $false )
| ( ( q
| r )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[53]) ).
thf(58,plain,
( ( ~ ( ~ r
| p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[54]) ).
thf(59,plain,
( ( ~ ( ~ r
| q ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[54]) ).
thf(60,plain,
( ( ~ q )
= $false ),
inference(extcnf_or_neg,[status(thm)],[55]) ).
thf(61,plain,
( ( ~ ~ p )
= $false ),
inference(extcnf_or_neg,[status(thm)],[55]) ).
thf(62,plain,
( ( q = $true )
| ( r = $true )
| ( p = $false ) ),
inference(extcnf_or_pos,[status(thm)],[57]) ).
thf(63,plain,
( ( ~ r
| p )
= $true ),
inference(extcnf_not_neg,[status(thm)],[58]) ).
thf(64,plain,
( ( ~ r
| q )
= $true ),
inference(extcnf_not_neg,[status(thm)],[59]) ).
thf(65,plain,
q = $true,
inference(extcnf_not_neg,[status(thm)],[60]) ).
thf(66,plain,
( ( ~ p )
= $true ),
inference(extcnf_not_neg,[status(thm)],[61]) ).
thf(67,plain,
( ( ( ~ r )
= $true )
| ( p = $true ) ),
inference(extcnf_or_pos,[status(thm)],[63]) ).
thf(68,plain,
( ( ( ~ r )
= $true )
| ( q = $true ) ),
inference(extcnf_or_pos,[status(thm)],[64]) ).
thf(69,plain,
p = $false,
inference(extcnf_not_pos,[status(thm)],[66]) ).
thf(70,plain,
( ( r = $false )
| ( p = $true ) ),
inference(extcnf_not_pos,[status(thm)],[67]) ).
thf(71,plain,
( ( r = $false )
| ( q = $true ) ),
inference(extcnf_not_pos,[status(thm)],[68]) ).
thf(72,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[56,71,70,69,65,62]) ).
thf(73,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[72,45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN044+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n014.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 : Mon Jul 11 23:36:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 3
% 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.19/0.34 (rf:0,axioms:3,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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:5,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.19/0.38 ********************************
% 0.19/0.38 * All subproblems solved! *
% 0.19/0.38 ********************************
% 0.19/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:72,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.39
% 0.19/0.39 %**** Beginning of derivation protocol ****
% 0.19/0.39 % SZS output start CNFRefutation
% See solution above
% 0.19/0.39
% 0.19/0.39 %**** End of derivation protocol ****
% 0.19/0.39 %**** no. of clauses in derivation: 73 ****
% 0.19/0.39 %**** clause counter: 72 ****
% 0.19/0.39
% 0.19/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:72,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------