TSTP Solution File: SYN062+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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 : 300s
% DateTime : Wed May 31 12:45:51 EDT 2023
% Result : Theorem 0.14s 0.52s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 27 ~; 24 |; 9 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 12 (; 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] :
( ( big_f(X)
& ( big_g(X)
| big_h(X) ) )
=> big_i(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X] :
( ( big_i(X)
& big_h(X) )
=> big_j(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] :
( big_k(X)
=> big_h(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,conjecture,
! [X] :
( ( big_f(X)
& big_k(X) )
=> big_j(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ ! [X] :
( ( big_f(X)
& big_k(X) )
=> big_j(X) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X] :
( ~ big_f(X)
| ( ~ big_g(X)
& ~ big_h(X) )
| big_i(X) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f8,plain,
! [X0] :
( ~ big_f(X0)
| ~ big_h(X0)
| big_i(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f9,plain,
! [X] :
( ~ big_i(X)
| ~ big_h(X)
| big_j(X) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f10,plain,
! [X0] :
( ~ big_i(X0)
| ~ big_h(X0)
| big_j(X0) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f11,plain,
! [X] :
( ~ big_k(X)
| big_h(X) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f12,plain,
! [X0] :
( ~ big_k(X0)
| big_h(X0) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f13,plain,
? [X] :
( big_f(X)
& big_k(X)
& ~ big_j(X) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f14,plain,
( big_f(sk0_0)
& big_k(sk0_0)
& ~ big_j(sk0_0) ),
inference(skolemization,[status(esa)],[f13]) ).
fof(f15,plain,
big_f(sk0_0),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f16,plain,
big_k(sk0_0),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f17,plain,
~ big_j(sk0_0),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f18,plain,
big_h(sk0_0),
inference(resolution,[status(thm)],[f12,f16]) ).
fof(f19,plain,
( spl0_0
<=> big_f(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f21,plain,
( ~ big_f(sk0_0)
| spl0_0 ),
inference(component_clause,[status(thm)],[f19]) ).
fof(f22,plain,
( spl0_1
<=> big_i(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f23,plain,
( big_i(sk0_0)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( ~ big_f(sk0_0)
| big_i(sk0_0) ),
inference(resolution,[status(thm)],[f8,f18]) ).
fof(f26,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f25,f19,f22]) ).
fof(f27,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f21,f15]) ).
fof(f28,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f27]) ).
fof(f29,plain,
( spl0_2
<=> big_h(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f31,plain,
( ~ big_h(sk0_0)
| spl0_2 ),
inference(component_clause,[status(thm)],[f29]) ).
fof(f32,plain,
( spl0_3
<=> big_j(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f33,plain,
( big_j(sk0_0)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f32]) ).
fof(f35,plain,
( ~ big_h(sk0_0)
| big_j(sk0_0)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f23,f10]) ).
fof(f36,plain,
( ~ spl0_2
| spl0_3
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f35,f29,f32,f22]) ).
fof(f37,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f31,f18]) ).
fof(f38,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f37]) ).
fof(f39,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f33,f17]) ).
fof(f40,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f39]) ).
fof(f41,plain,
$false,
inference(sat_refutation,[status(thm)],[f26,f28,f36,f38,f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n005.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue May 30 10:23:36 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.29 % Drodi V3.5.1
% 0.14/0.52 % Refutation found
% 0.14/0.52 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.52 % Elapsed time: 0.011055 seconds
% 0.14/0.52 % CPU time: 0.010450 seconds
% 0.14/0.52 % Memory used: 1.777 MB
%------------------------------------------------------------------------------