TSTP Solution File: LCL035-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : n032.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 : Tue Apr 30 20:26:11 EDT 2024
% Result : Unsatisfiable 0.10s 0.33s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n032.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 : Mon Apr 29 20:23:20 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.32 % Drodi V3.6.0
% 0.10/0.33 % Refutation found
% 0.10/0.33 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.33 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.33 fof(f1,axiom,(
% 0.10/0.33 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f2,axiom,(
% 0.10/0.33 (![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.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f3,negated_conjecture,(
% 0.10/0.33 ~ is_a_theorem(implies(falsehood,a)) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f4,plain,(
% 0.10/0.33 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.10/0.33 inference(miniscoping,[status(esa)],[f1])).
% 0.10/0.33 fof(f5,plain,(
% 0.10/0.33 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.33 fof(f6,plain,(
% 0.10/0.33 ![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.10/0.33 inference(cnf_transformation,[status(esa)],[f2])).
% 0.10/0.33 fof(f7,plain,(
% 0.10/0.33 ~is_a_theorem(implies(falsehood,a))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f3])).
% 0.10/0.33 fof(f8,plain,(
% 0.10/0.33 ![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.10/0.33 inference(resolution,[status(thm)],[f6,f5])).
% 0.10/0.33 fof(f9,plain,(
% 0.10/0.33 ![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.10/0.33 inference(resolution,[status(thm)],[f8,f6])).
% 0.10/0.33 fof(f10,plain,(
% 0.10/0.33 ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))))),
% 0.10/0.33 inference(resolution,[status(thm)],[f9,f8])).
% 0.10/0.33 fof(f12,plain,(
% 0.10/0.33 ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X2),implies(falsehood,X2))))),
% 0.10/0.33 inference(resolution,[status(thm)],[f10,f8])).
% 0.10/0.33 fof(f13,plain,(
% 0.10/0.33 ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))|is_a_theorem(implies(X3,X2)))),
% 0.10/0.33 inference(resolution,[status(thm)],[f10,f5])).
% 0.10/0.33 fof(f14,plain,(
% 0.10/0.33 ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(falsehood,X0),X1),implies(X2,X1))))),
% 0.10/0.33 inference(resolution,[status(thm)],[f12,f8])).
% 0.10/0.33 fof(f15,plain,(
% 0.10/0.33 ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X2))|is_a_theorem(implies(falsehood,X2)))),
% 0.10/0.33 inference(resolution,[status(thm)],[f12,f5])).
% 0.10/0.33 fof(f17,plain,(
% 0.10/0.33 ![X0,X1]: (is_a_theorem(implies(falsehood,implies(X0,X1))))),
% 0.10/0.33 inference(resolution,[status(thm)],[f15,f14])).
% 0.10/0.33 fof(f30,plain,(
% 0.10/0.33 ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(X1,implies(falsehood,X2)))))),
% 0.10/0.33 inference(resolution,[status(thm)],[f13,f14])).
% 0.10/0.33 fof(f44,plain,(
% 0.10/0.33 spl0_2 <=> ~is_a_theorem(X0)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f45,plain,(
% 0.10/0.33 ![X0]: (~is_a_theorem(X0)|~spl0_2)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f44])).
% 0.10/0.33 fof(f67,plain,(
% 0.10/0.33 spl0_5 <=> is_a_theorem(implies(X1,implies(falsehood,X2)))),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f68,plain,(
% 0.10/0.33 ![X0,X1]: (is_a_theorem(implies(X0,implies(falsehood,X1)))|~spl0_5)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f67])).
% 0.10/0.33 fof(f70,plain,(
% 0.10/0.33 ![X0,X1,X2]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,implies(falsehood,X2))))),
% 0.10/0.33 inference(resolution,[status(thm)],[f30,f5])).
% 0.10/0.33 fof(f71,plain,(
% 0.10/0.33 spl0_2|spl0_5),
% 0.10/0.33 inference(split_clause,[status(thm)],[f70,f44,f67])).
% 0.10/0.33 fof(f168,plain,(
% 0.10/0.33 $false|~spl0_2),
% 0.10/0.33 inference(backward_subsumption_resolution,[status(thm)],[f17,f45])).
% 0.10/0.33 fof(f169,plain,(
% 0.10/0.33 ~spl0_2),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f168])).
% 0.10/0.33 fof(f173,plain,(
% 0.10/0.33 spl0_12 <=> is_a_theorem(implies(falsehood,X1))),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f174,plain,(
% 0.10/0.33 ![X0]: (is_a_theorem(implies(falsehood,X0))|~spl0_12)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f173])).
% 0.10/0.33 fof(f176,plain,(
% 0.10/0.33 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(falsehood,X1))|~spl0_5)),
% 0.10/0.33 inference(resolution,[status(thm)],[f5,f68])).
% 0.10/0.33 fof(f177,plain,(
% 0.10/0.33 spl0_2|spl0_12|~spl0_5),
% 0.10/0.33 inference(split_clause,[status(thm)],[f176,f44,f173,f67])).
% 0.10/0.33 fof(f193,plain,(
% 0.10/0.33 $false|~spl0_12),
% 0.10/0.33 inference(backward_subsumption_resolution,[status(thm)],[f7,f174])).
% 0.10/0.33 fof(f194,plain,(
% 0.10/0.33 ~spl0_12),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f193])).
% 0.10/0.33 fof(f195,plain,(
% 0.10/0.33 $false),
% 0.10/0.33 inference(sat_refutation,[status(thm)],[f71,f169,f177,f194])).
% 0.10/0.33 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.35 % Elapsed time: 0.017672 seconds
% 0.10/0.35 % CPU time: 0.028588 seconds
% 0.10/0.35 % Total memory used: 7.264 MB
% 0.10/0.35 % Net memory used: 7.143 MB
%------------------------------------------------------------------------------