TSTP Solution File: SYO018^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO018^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n025.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:31:24 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 91 ( 13 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 115 ( 18 ~; 5 |; 11 &; 78 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 14 ^ 0 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: ( $i > $i ) > $o ).
thf(tp_b,type,
b: $o ).
thf(tp_f,type,
f: $o > $i > $i ).
thf(tp_p,type,
p: ( $i > $i ) > $o ).
thf(tp_sK1_E,type,
sK1_E: $i ).
thf(tp_sK2_E,type,
sK2_E: $i ).
thf(1,conjecture,
( ( p
@ ^ [X: $i] :
( f
@ ( ( a
@ ^ [X: $i] : ( f @ b @ X ) )
& b )
@ X ) )
=> ( p
@ ( f
@ ( b
& ( a @ ( f @ b ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ( p
@ ^ [X: $i] :
( f
@ ( ( a
@ ^ [X: $i] : ( f @ b @ X ) )
& b )
@ X ) )
=> ( p
@ ( f
@ ( b
& ( a @ ( f @ b ) ) ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( p
@ ^ [X: $i] :
( f
@ ( ( a
@ ^ [X: $i] : ( f @ b @ X ) )
& b )
@ X ) )
=> ( p
@ ( f
@ ( b
& ( a @ ( f @ b ) ) ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( p
@ ^ [X: $i] :
( f
@ ( ( a
@ ^ [X: $i] : ( f @ b @ X ) )
& b )
@ X ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( p
@ ( f
@ ( b
& ( a @ ( f @ b ) ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ( p
@ ( f
@ ( b
& ( a @ ( f @ b ) ) ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( p
@ ^ [X: $i] :
( f
@ ( ( a
@ ^ [X: $i] : ( f @ b @ X ) )
& b )
@ X ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(8,plain,
( ( ~ ( p
@ ( f
@ ( b
& ( a @ ( f @ b ) ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ( p
@ ( f
@ ~ ( ~ b
| ~ ( a @ ( f @ b ) ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( p
@ ^ [SX0: $i] :
( f
@ ~ ( ~ ( a
@ ^ [SX1: $i] : ( f @ b @ SX1 ) )
| ~ b )
@ SX0 ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(11,plain,
( ( p
@ ( f
@ ~ ( ~ b
| ~ ( a @ ( f @ b ) ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(12,plain,
( ( ( p
@ ( f
@ ~ ( ~ b
| ~ ( a @ ( f @ b ) ) ) ) )
= ( p
@ ^ [SX0: $i] :
( f
@ ~ ( ~ ( a
@ ^ [SX1: $i] : ( f @ b @ SX1 ) )
| ~ b )
@ SX0 ) ) )
= $false ),
inference(res,[status(thm)],[11,10]) ).
thf(13,plain,
$false = $true,
inference(extuni,[status(esa)],[12]) ).
thf(14,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO018^1 : TPTP v8.1.0. Released v3.7.0.
% 0.04/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 05:36:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36
% 0.13/0.36 No.of.Axioms: 0
% 0.13/0.36
% 0.13/0.36 Length.of.Defs: 0
% 0.13/0.36
% 0.13/0.36 Contains.Choice.Funs: false
% 0.13/0.36 (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.21/0.40 ********************************
% 0.21/0.40 * All subproblems solved! *
% 0.21/0.40 ********************************
% 0.21/0.40 % 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:13,loop_count:2,foatp_calls:1,translation:fof_full)
% 0.21/0.40
% 0.21/0.40 %**** Beginning of derivation protocol ****
% 0.21/0.40 % SZS output start CNFRefutation
% See solution above
% 0.21/0.40
% 0.21/0.40 %**** End of derivation protocol ****
% 0.21/0.40 %**** no. of clauses in derivation: 14 ****
% 0.21/0.40 %**** clause counter: 13 ****
% 0.21/0.40
% 0.21/0.40 % 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:13,loop_count:2,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------