TSTP Solution File: LCL075-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.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:10 EDT 2023
% Result : Unsatisfiable 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 13 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 54 (; 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z,U,V] : is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(not(Z),not(U))),Z),V),implies(implies(V,X),implies(U,X)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,plain,
! [Y] :
( ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| is_a_theorem(Y) ),
inference(miniscoping,[status(esa)],[f1]) ).
fof(f5,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(not(X2),not(X3))),X2),X4),implies(implies(X4,X0),implies(X3,X0)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4] :
( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(not(X2),not(X3))),X2),X4))
| is_a_theorem(implies(implies(X4,X0),implies(X3,X0))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f10,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f12,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X0),X1),implies(X2,X1))),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(implies(X0,X0),X1))
| is_a_theorem(implies(X2,X1)) ),
inference(resolution,[status(thm)],[f12,f5]) ).
fof(f18,plain,
! [X0,X1,X2] : is_a_theorem(implies(X0,implies(X1,implies(X2,X2)))),
inference(resolution,[status(thm)],[f15,f12]) ).
fof(f19,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(implies(implies(X0,implies(X1,X1)),X2),implies(X3,X2))),
inference(resolution,[status(thm)],[f18,f8]) ).
fof(f36,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[status(thm)],[f19,f8]) ).
fof(f39,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(implies(not(X0),not(X1)),X0),X2),implies(X1,X2))),
inference(resolution,[status(thm)],[f36,f8]) ).
fof(f4975,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(implies(implies(not(X0),not(X1)),X0),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[status(thm)],[f39,f5]) ).
fof(f5098,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(resolution,[status(thm)],[f4975,f36]) ).
fof(f5186,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f7,f5098]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.34 % CPULimit : 300
% 0.19/0.34 % WCLimit : 300
% 0.19/0.34 % DateTime : Tue May 30 09:38:46 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.35 % Drodi V3.5.1
% 0.19/0.53 % Refutation found
% 0.19/0.53 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.53 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.55 % Elapsed time: 0.200986 seconds
% 0.19/0.55 % CPU time: 1.018711 seconds
% 0.19/0.55 % Memory used: 46.750 MB
%------------------------------------------------------------------------------