TSTP Solution File: LCL035-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 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:18:04 EDT 2023
% Result : Unsatisfiable 0.15s 0.34s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 09:38:07 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.31 % Drodi V3.5.1
% 0.15/0.34 % Refutation found
% 0.15/0.34 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.34 % SZS output start CNFRefutation for theBenchmark
% 0.15/0.34 fof(f1,axiom,(
% 0.15/0.34 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.15/0.34 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.34 fof(f2,axiom,(
% 0.15/0.34 (![X,Y,Z,U,V]: (is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))) ))),
% 0.15/0.34 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.34 fof(f3,negated_conjecture,(
% 0.15/0.34 ~ is_a_theorem(implies(falsehood,a)) ),
% 0.15/0.34 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.34 fof(f4,plain,(
% 0.15/0.34 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.15/0.34 inference(miniscoping,[status(esa)],[f1])).
% 0.15/0.34 fof(f5,plain,(
% 0.15/0.34 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.15/0.34 inference(cnf_transformation,[status(esa)],[f4])).
% 0.15/0.34 fof(f6,plain,(
% 0.15/0.34 ![X0,X1,X2,X3,X4]: (is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))))),
% 0.15/0.34 inference(cnf_transformation,[status(esa)],[f2])).
% 0.15/0.34 fof(f7,plain,(
% 0.15/0.34 ~is_a_theorem(implies(falsehood,a))),
% 0.15/0.34 inference(cnf_transformation,[status(esa)],[f3])).
% 0.15/0.34 fof(f8,plain,(
% 0.15/0.34 ![X0,X1,X2,X3,X4]: (~is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4))|is_a_theorem(implies(implies(X4,X0),implies(X2,X0))))),
% 0.15/0.34 inference(resolution,[status(thm)],[f6,f5])).
% 0.15/0.34 fof(f20,plain,(
% 0.15/0.34 spl0_0 <=> ~is_a_theorem(X0)),
% 0.15/0.34 introduced(split_symbol_definition)).
% 0.15/0.34 fof(f21,plain,(
% 0.15/0.34 ![X0]: (~is_a_theorem(X0)|~spl0_0)),
% 0.15/0.34 inference(component_clause,[status(thm)],[f20])).
% 0.15/0.34 fof(f28,plain,(
% 0.15/0.34 $false|~spl0_0),
% 0.15/0.34 inference(backward_subsumption_resolution,[status(thm)],[f6,f21])).
% 0.15/0.34 fof(f29,plain,(
% 0.15/0.34 ~spl0_0),
% 0.15/0.34 inference(contradiction_clause,[status(thm)],[f28])).
% 0.15/0.34 fof(f39,plain,(
% 0.15/0.34 ![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)))))),
% 0.15/0.34 inference(resolution,[status(thm)],[f6,f8])).
% 0.15/0.34 fof(f43,plain,(
% 0.15/0.34 ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))))),
% 0.15/0.34 inference(resolution,[status(thm)],[f39,f8])).
% 0.15/0.34 fof(f50,plain,(
% 0.15/0.34 ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))|is_a_theorem(implies(X3,X2)))),
% 0.15/0.34 inference(resolution,[status(thm)],[f43,f5])).
% 0.15/0.34 fof(f55,plain,(
% 0.15/0.34 spl0_2 <=> ~is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))|is_a_theorem(X2)),
% 0.15/0.34 introduced(split_symbol_definition)).
% 0.15/0.34 fof(f56,plain,(
% 0.15/0.34 ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))|is_a_theorem(X2)|~spl0_2)),
% 0.15/0.34 inference(component_clause,[status(thm)],[f55])).
% 0.15/0.34 fof(f58,plain,(
% 0.15/0.34 ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))|~is_a_theorem(X3)|is_a_theorem(X2))),
% 0.15/0.34 inference(resolution,[status(thm)],[f50,f5])).
% 0.15/0.34 fof(f59,plain,(
% 0.15/0.34 spl0_2|spl0_0),
% 0.15/0.34 inference(split_clause,[status(thm)],[f58,f55,f20])).
% 0.15/0.34 fof(f62,plain,(
% 0.15/0.34 ![X0,X1]: (is_a_theorem(implies(X0,implies(falsehood,X1)))|~spl0_2)),
% 0.15/0.34 inference(resolution,[status(thm)],[f56,f39])).
% 0.15/0.34 fof(f67,plain,(
% 0.15/0.34 ![X0]: (is_a_theorem(implies(falsehood,X0))|~spl0_2)),
% 0.15/0.34 inference(resolution,[status(thm)],[f62,f56])).
% 0.15/0.34 fof(f75,plain,(
% 0.15/0.34 $false|~spl0_2),
% 0.15/0.34 inference(backward_subsumption_resolution,[status(thm)],[f7,f67])).
% 0.15/0.34 fof(f76,plain,(
% 0.15/0.34 ~spl0_2),
% 0.15/0.34 inference(contradiction_clause,[status(thm)],[f75])).
% 0.15/0.34 fof(f77,plain,(
% 0.15/0.34 $false),
% 0.15/0.34 inference(sat_refutation,[status(thm)],[f29,f59,f76])).
% 0.15/0.34 % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.56 % Elapsed time: 0.030495 seconds
% 0.15/0.56 % CPU time: 0.018375 seconds
% 0.15/0.56 % Memory used: 1.968 MB
%------------------------------------------------------------------------------