TSTP Solution File: SYO526^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO526^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n023.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:35:22 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 84 ( 42 unt; 5 typ; 0 def)
% Number of atoms : 430 ( 134 equ; 0 cnn)
% Maximal formula atoms : 2 ( 5 avg)
% Number of connectives : 251 ( 86 ~; 79 |; 2 &; 82 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 11 ^ 35 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $o ).
thf(tp_b,type,
b: $o ).
thf(tp_f,type,
f: $i > $o ).
thf(tp_g,type,
g: $i > $o ).
thf(tp_sK1_SV5,type,
sK1_SV5: $i ).
thf(1,axiom,
( f
= ( ^ [X: $i] : a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fa) ).
thf(2,axiom,
f = g,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fg) ).
thf(3,axiom,
( a
<=> b ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab) ).
thf(4,conjecture,
( g
= ( ^ [X: $i] : b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gb) ).
thf(5,negated_conjecture,
( ( g
= ( ^ [X: $i] : b ) )
= $false ),
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,plain,
( ( g
= ( ^ [X: $i] : b ) )
= $false ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( f
= ( ^ [X: $i] : a ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( f = g )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( a
<=> b )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(10,plain,
( ( ( g
!= ( ^ [X: $i] : b ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ( ~ a
| b )
& ( ~ b
| a ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(12,plain,
( ( ( ~ a
| b )
& ( ~ b
| a ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(13,plain,
( ( f = g )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( f
= ( ^ [X: $i] : a ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(15,plain,
( ( ( g
!= ( ^ [X: $i] : b ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( ~ ( ~ ( ~ a
| b )
| ~ ( ~ b
| a ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(17,plain,
( ( ! [SV1: $i] :
( ( f @ SV1 )
= ( g @ SV1 ) ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[13]) ).
thf(18,plain,
( ( f = g )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[13]) ).
thf(19,plain,
( ( ! [SV2: $i] :
( ( f @ SV2 )
= a ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[14]) ).
thf(20,plain,
( ( f
= ( ^ [X: $i] : a ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[14]) ).
thf(21,plain,
( ( g
= ( ^ [X: $i] : b ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(22,plain,
( ( ~ ( ~ a
| b )
| ~ ( ~ b
| a ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(23,plain,
! [SV3: $i] :
( ( ( f @ SV3 )
= ( g @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(24,plain,
! [SV4: $i] :
( ( ( f @ SV4 )
= a )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(25,plain,
( ( ! [SV5: $i] :
( ( g @ SV5 )
= b ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[21]) ).
thf(26,plain,
( ( g
= ( ^ [X: $i] : b ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[21]) ).
thf(27,plain,
( ( ~ ( ~ a
| b ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(28,plain,
( ( ~ ( ~ b
| a ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(29,plain,
! [SV3: $i] :
( ( ~ ( ( f @ SV3 )
| ( g @ SV3 ) )
| ~ ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[23]) ).
thf(30,plain,
! [SV3: $i] :
( ( ( f @ SV3 )
= ( g @ SV3 ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[23]) ).
thf(31,plain,
! [SV4: $i] :
( ( ~ ( ( f @ SV4 )
| a )
| ~ ( ~ ( f @ SV4 )
| ~ a ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[24]) ).
thf(32,plain,
! [SV4: $i] :
( ( ( f @ SV4 )
= a )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[24]) ).
thf(33,plain,
( ( ( g @ sK1_SV5 )
= b )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[25]) ).
thf(34,plain,
( ( ~ a
| b )
= $true ),
inference(extcnf_not_neg,[status(thm)],[27]) ).
thf(35,plain,
( ( ~ b
| a )
= $true ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(36,plain,
! [SV3: $i] :
( ( ( ~ ( ( f @ SV3 )
| ( g @ SV3 ) ) )
= $true )
| ( ( ~ ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[29]) ).
thf(37,plain,
! [SV4: $i] :
( ( ( ~ ( ( f @ SV4 )
| a ) )
= $true )
| ( ( ~ ( ~ ( f @ SV4 )
| ~ a ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(38,plain,
( ( ~ ( ( g @ sK1_SV5 )
| b )
| ~ ( ~ ( g @ sK1_SV5 )
| ~ b ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[33]) ).
thf(39,plain,
( ( ( g @ sK1_SV5 )
= b )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[33]) ).
thf(40,plain,
( ( ( ~ a )
= $true )
| ( b = $true ) ),
inference(extcnf_or_pos,[status(thm)],[34]) ).
thf(41,plain,
( ( ( ~ b )
= $true )
| ( a = $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(42,plain,
! [SV3: $i] :
( ( ( ( f @ SV3 )
| ( g @ SV3 ) )
= $false )
| ( ( ~ ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(43,plain,
! [SV4: $i] :
( ( ( ( f @ SV4 )
| a )
= $false )
| ( ( ~ ( ~ ( f @ SV4 )
| ~ a ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(44,plain,
( ( ~ ( ( g @ sK1_SV5 )
| b ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[38]) ).
thf(45,plain,
( ( ~ ( ~ ( g @ sK1_SV5 )
| ~ b ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[38]) ).
thf(46,plain,
( ( a = $false )
| ( b = $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(47,plain,
( ( b = $false )
| ( a = $true ) ),
inference(extcnf_not_pos,[status(thm)],[41]) ).
thf(48,plain,
! [SV3: $i] :
( ( ( f @ SV3 )
= $false )
| ( ( ~ ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[42]) ).
thf(49,plain,
! [SV3: $i] :
( ( ( g @ SV3 )
= $false )
| ( ( ~ ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[42]) ).
thf(50,plain,
! [SV4: $i] :
( ( ( f @ SV4 )
= $false )
| ( ( ~ ( ~ ( f @ SV4 )
| ~ a ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[43]) ).
thf(51,plain,
! [SV4: $i] :
( ( a = $false )
| ( ( ~ ( ~ ( f @ SV4 )
| ~ a ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[43]) ).
thf(52,plain,
( ( ( g @ sK1_SV5 )
| b )
= $true ),
inference(extcnf_not_neg,[status(thm)],[44]) ).
thf(53,plain,
( ( ~ ( g @ sK1_SV5 )
| ~ b )
= $true ),
inference(extcnf_not_neg,[status(thm)],[45]) ).
thf(54,plain,
! [SV3: $i] :
( ( ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) )
= $false )
| ( ( f @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(55,plain,
! [SV3: $i] :
( ( ( ~ ( f @ SV3 )
| ~ ( g @ SV3 ) )
= $false )
| ( ( g @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(56,plain,
! [SV4: $i] :
( ( ( ~ ( f @ SV4 )
| ~ a )
= $false )
| ( ( f @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(57,plain,
! [SV4: $i] :
( ( ( ~ ( f @ SV4 )
| ~ a )
= $false )
| ( a = $false ) ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(58,plain,
( ( ( g @ sK1_SV5 )
= $true )
| ( b = $true ) ),
inference(extcnf_or_pos,[status(thm)],[52]) ).
thf(59,plain,
( ( ( ~ ( g @ sK1_SV5 ) )
= $true )
| ( ( ~ b )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(60,plain,
! [SV3: $i] :
( ( ( ~ ( f @ SV3 ) )
= $false )
| ( ( f @ SV3 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[54]) ).
thf(61,plain,
! [SV3: $i] :
( ( ( ~ ( g @ SV3 ) )
= $false )
| ( ( f @ SV3 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[54]) ).
thf(62,plain,
! [SV3: $i] :
( ( ( ~ ( f @ SV3 ) )
= $false )
| ( ( g @ SV3 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[55]) ).
thf(63,plain,
! [SV3: $i] :
( ( ( ~ ( g @ SV3 ) )
= $false )
| ( ( g @ SV3 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[55]) ).
thf(64,plain,
! [SV4: $i] :
( ( ( ~ ( f @ SV4 ) )
= $false )
| ( ( f @ SV4 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[56]) ).
thf(65,plain,
! [SV4: $i] :
( ( ( ~ a )
= $false )
| ( ( f @ SV4 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[56]) ).
thf(66,plain,
! [SV4: $i] :
( ( ( ~ ( f @ SV4 ) )
= $false )
| ( a = $false ) ),
inference(extcnf_or_neg,[status(thm)],[57]) ).
thf(67,plain,
( ( ( ~ a )
= $false )
| ( a = $false ) ),
inference(extcnf_or_neg,[status(thm)],[57]) ).
thf(68,plain,
( ( ( g @ sK1_SV5 )
= $false )
| ( ( ~ b )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[59]) ).
thf(69,plain,
! [SV3: $i] :
( ( ( f @ SV3 )
= $true )
| ( ( f @ SV3 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[60]) ).
thf(70,plain,
! [SV3: $i] :
( ( ( g @ SV3 )
= $true )
| ( ( f @ SV3 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[61]) ).
thf(71,plain,
! [SV3: $i] :
( ( ( f @ SV3 )
= $true )
| ( ( g @ SV3 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[62]) ).
thf(72,plain,
! [SV3: $i] :
( ( ( g @ SV3 )
= $true )
| ( ( g @ SV3 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[63]) ).
thf(73,plain,
! [SV4: $i] :
( ( ( f @ SV4 )
= $true )
| ( ( f @ SV4 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[64]) ).
thf(74,plain,
! [SV4: $i] :
( ( a = $true )
| ( ( f @ SV4 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[65]) ).
thf(75,plain,
! [SV4: $i] :
( ( ( f @ SV4 )
= $true )
| ( a = $false ) ),
inference(extcnf_not_neg,[status(thm)],[66]) ).
thf(76,plain,
( ( a = $true )
| ( a = $false ) ),
inference(extcnf_not_neg,[status(thm)],[67]) ).
thf(77,plain,
( ( b = $false )
| ( ( g @ sK1_SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[68]) ).
thf(78,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[18,77,76,75,74,73,72,71,70,69,58,47,46,39,32,30,26,20]) ).
thf(79,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO526^1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n023.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 01:13:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 3
% 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: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:25,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.13/0.38 ********************************
% 0.13/0.38 * All subproblems solved! *
% 0.13/0.38 ********************************
% 0.13/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:78,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.39
% 0.13/0.39 %**** Beginning of derivation protocol ****
% 0.13/0.39 % SZS output start CNFRefutation
% See solution above
% 0.13/0.39
% 0.13/0.39 %**** End of derivation protocol ****
% 0.13/0.39 %**** no. of clauses in derivation: 79 ****
% 0.13/0.39 %**** clause counter: 78 ****
% 0.13/0.39
% 0.13/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:78,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------