TSTP Solution File: LCL173-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL173-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:18:28 EDT 2023
% Result : Unsatisfiable 0.13s 0.52s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 11 (; 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,plain,
! [X0,X1,X2] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f15,plain,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f20,plain,
~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f90,plain,
! [X0,X1,X2] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[status(thm)],[f14,f15]) ).
fof(f91,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f20,f90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL173-1 : TPTP v8.1.2. Released v1.1.0.
% 0.02/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n009.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 09:39:46 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.09/0.30 % Drodi V3.5.1
% 0.13/0.52 % Refutation found
% 0.13/0.52 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.52 % Elapsed time: 0.014041 seconds
% 0.13/0.52 % CPU time: 0.020426 seconds
% 0.13/0.52 % Memory used: 2.616 MB
%------------------------------------------------------------------------------