TSTP Solution File: SYN101-1.002.002 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SYN101-1.002.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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:59 EDT 2023
% Result : Unsatisfiable 0.15s 0.37s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 26 ~; 24 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 18 (; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
~ p_1_2(a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X_1,X_2] :
( p_1_2(X_1,X_2)
| ~ p_2_2(X_1,X_2)
| ~ p_1_1(X_1,X_2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X_1,X_2] :
( p_1_1(X_1,X_2)
| ~ nq_1(X_1)
| ~ nq_2(X_2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [X_1,X_2] :
( p_2_2(X_1,X_2)
| ~ nq_1(X_1)
| ~ nq_2(X_2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
nq_1(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
nq_2(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,plain,
~ p_1_2(a,a),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f19,plain,
! [X0,X1] :
( p_1_2(X0,X1)
| ~ p_2_2(X0,X1)
| ~ p_1_1(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f27,plain,
! [X_2] :
( ! [X_1] :
( p_1_1(X_1,X_2)
| ~ nq_1(X_1) )
| ~ nq_2(X_2) ),
inference(miniscoping,[status(esa)],[f10]) ).
fof(f28,plain,
! [X0,X1] :
( p_1_1(X0,X1)
| ~ nq_1(X0)
| ~ nq_2(X1) ),
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f31,plain,
! [X_2] :
( ! [X_1] :
( p_2_2(X_1,X_2)
| ~ nq_1(X_1) )
| ~ nq_2(X_2) ),
inference(miniscoping,[status(esa)],[f12]) ).
fof(f32,plain,
! [X0,X1] :
( p_2_2(X0,X1)
| ~ nq_1(X0)
| ~ nq_2(X1) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f35,plain,
nq_1(a),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f37,plain,
nq_2(a),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f40,plain,
! [X0] :
( p_1_1(X0,a)
| ~ nq_1(X0) ),
inference(resolution,[status(thm)],[f28,f37]) ).
fof(f42,plain,
p_1_1(a,a),
inference(resolution,[status(thm)],[f40,f35]) ).
fof(f51,plain,
( spl0_2
<=> p_1_2(a,a) ),
introduced(split_symbol_definition) ).
fof(f52,plain,
( p_1_2(a,a)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f51]) ).
fof(f54,plain,
( spl0_3
<=> p_2_2(a,a) ),
introduced(split_symbol_definition) ).
fof(f56,plain,
( ~ p_2_2(a,a)
| spl0_3 ),
inference(component_clause,[status(thm)],[f54]) ).
fof(f57,plain,
( p_1_2(a,a)
| ~ p_2_2(a,a) ),
inference(resolution,[status(thm)],[f42,f19]) ).
fof(f58,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f57,f51,f54]) ).
fof(f124,plain,
! [X0] :
( p_2_2(X0,a)
| ~ nq_1(X0) ),
inference(resolution,[status(thm)],[f32,f37]) ).
fof(f128,plain,
p_2_2(a,a),
inference(resolution,[status(thm)],[f124,f35]) ).
fof(f135,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f128]) ).
fof(f136,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f135]) ).
fof(f137,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f52,f18]) ).
fof(f138,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f137]) ).
fof(f139,plain,
$false,
inference(sat_refutation,[status(thm)],[f58,f136,f138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN101-1.002.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue May 30 10:28:52 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % Drodi V3.5.1
% 0.15/0.37 % Refutation found
% 0.15/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.37 % Elapsed time: 0.020369 seconds
% 0.15/0.37 % CPU time: 0.029567 seconds
% 0.15/0.37 % Memory used: 7.191 MB
%------------------------------------------------------------------------------