TSTP Solution File: SYO013^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO013^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 : n010.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:22 EDT 2022
% Result : Theorem 0.21s 0.37s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 17 unt; 3 typ; 0 def)
% Number of atoms : 91 ( 23 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 27 ( 2 ~; 2 |; 6 &; 14 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 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_a,type,
a: $o ).
thf(tp_b,type,
b: $o ).
thf(tp_p,type,
p: $o > $o ).
thf(1,conjecture,
( ( a
& b
& ( p @ a ) )
=> ( p @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ( a
& b
& ( p @ a ) )
=> ( p @ b ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( a
& b
& ( p @ a ) )
=> ( p @ b ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
a = $true,
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
b = $true,
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( p @ a )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( p @ b )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( ~ ( p @ b ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( p @ a )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(10,plain,
b = $true,
inference(copy,[status(thm)],[5]) ).
thf(11,plain,
a = $true,
inference(copy,[status(thm)],[4]) ).
thf(12,plain,
( ( ~ ( p @ b ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( p @ b )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(16,plain,
( ( ( p @ b )
= ( p @ a ) )
= $false ),
inference(res,[status(thm)],[13,9]) ).
thf(18,plain,
( ( b = $false )
| ( a = $false ) ),
inference(extuni,[status(esa)],[16]) ).
thf(22,plain,
( ( ( b = b )
= $false )
| ( a = $false ) ),
inference(res,[status(thm)],[18,10]) ).
thf(26,plain,
a = $false,
inference(extuni,[status(esa)],[22]) ).
thf(28,plain,
( ( a = a )
= $false ),
inference(res,[status(thm)],[26,11]) ).
thf(31,plain,
$false = $true,
inference(extuni,[status(esa)],[28]) ).
thf(32,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO013^1 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n010.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:03:01 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.21/0.37 ********************************
% 0.21/0.37 * All subproblems solved! *
% 0.21/0.37 ********************************
% 0.21/0.37 % 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:31,loop_count:7,foatp_calls:1,translation:fof_full)
% 0.21/0.37
% 0.21/0.37 %**** Beginning of derivation protocol ****
% 0.21/0.37 % SZS output start CNFRefutation
% See solution above
% 0.21/0.37
% 0.21/0.37 %**** End of derivation protocol ****
% 0.21/0.37 %**** no. of clauses in derivation: 20 ****
% 0.21/0.37 %**** clause counter: 31 ****
% 0.21/0.37
% 0.21/0.37 % 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:31,loop_count:7,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------