TSTP Solution File: LCL362-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL362-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:19:04 EDT 2023
% Result : Unsatisfiable 0.09s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : LCL362-1 : TPTP v8.1.2. Released v2.3.0.
% 0.05/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n003.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 09:50:23 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % Drodi V3.5.1
% 0.09/0.31 % Refutation found
% 0.09/0.31 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.31 % SZS output start CNFRefutation for theBenchmark
% 0.09/0.31 fof(f1,axiom,(
% 0.09/0.31 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.09/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.31 fof(f2,axiom,(
% 0.09/0.31 (![X,Y,Z]: (is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ))),
% 0.09/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.31 fof(f3,axiom,(
% 0.09/0.31 (![X]: (is_a_theorem(implies(implies(not(X),X),X)) ))),
% 0.09/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.31 fof(f4,axiom,(
% 0.09/0.31 (![X,Y]: (is_a_theorem(implies(X,implies(not(X),Y))) ))),
% 0.09/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.31 fof(f5,negated_conjecture,(
% 0.09/0.31 ~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))) ),
% 0.09/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.31 fof(f6,plain,(
% 0.09/0.31 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.09/0.31 inference(miniscoping,[status(esa)],[f1])).
% 0.09/0.31 fof(f7,plain,(
% 0.09/0.31 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.09/0.31 inference(cnf_transformation,[status(esa)],[f6])).
% 0.09/0.31 fof(f8,plain,(
% 0.09/0.31 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))))),
% 0.09/0.31 inference(cnf_transformation,[status(esa)],[f2])).
% 0.09/0.31 fof(f9,plain,(
% 0.09/0.31 ![X0]: (is_a_theorem(implies(implies(not(X0),X0),X0)))),
% 0.09/0.31 inference(cnf_transformation,[status(esa)],[f3])).
% 0.09/0.31 fof(f10,plain,(
% 0.09/0.31 ![X0,X1]: (is_a_theorem(implies(X0,implies(not(X0),X1))))),
% 0.09/0.31 inference(cnf_transformation,[status(esa)],[f4])).
% 0.09/0.31 fof(f11,plain,(
% 0.09/0.31 ~is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))),
% 0.09/0.31 inference(cnf_transformation,[status(esa)],[f5])).
% 0.09/0.31 fof(f13,plain,(
% 0.09/0.31 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(not(X0),X1)))),
% 0.09/0.31 inference(resolution,[status(thm)],[f7,f10])).
% 0.09/0.31 fof(f14,plain,(
% 0.09/0.31 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(implies(X1,X2),implies(X0,X2))))),
% 0.09/0.31 inference(resolution,[status(thm)],[f8,f7])).
% 0.09/0.31 fof(f23,plain,(
% 0.09/0.31 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X2))|is_a_theorem(implies(X0,X2)))),
% 0.09/0.31 inference(resolution,[status(thm)],[f14,f7])).
% 0.09/0.31 fof(f24,plain,(
% 0.09/0.31 ![X0,X1,X2]: (~is_a_theorem(implies(X0,not(X1)))|is_a_theorem(implies(X0,X2))|~is_a_theorem(X1))),
% 0.09/0.31 inference(resolution,[status(thm)],[f23,f13])).
% 0.09/0.31 fof(f25,plain,(
% 0.09/0.31 ![X0,X1]: (~is_a_theorem(implies(X0,implies(not(X1),X1)))|is_a_theorem(implies(X0,X1)))),
% 0.09/0.31 inference(resolution,[status(thm)],[f23,f9])).
% 0.09/0.31 fof(f28,plain,(
% 0.09/0.31 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(X0,implies(not(X1),X2))))),
% 0.09/0.31 inference(resolution,[status(thm)],[f23,f10])).
% 0.09/0.31 fof(f32,plain,(
% 0.09/0.31 spl0_3 <=> ~is_a_theorem(X2)),
% 0.09/0.31 introduced(split_symbol_definition)).
% 0.09/0.31 fof(f33,plain,(
% 0.09/0.31 ![X0]: (~is_a_theorem(X0)|~spl0_3)),
% 0.09/0.31 inference(component_clause,[status(thm)],[f32])).
% 0.09/0.31 fof(f40,plain,(
% 0.09/0.31 ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),X1))|~is_a_theorem(implies(not(X1),X0)))),
% 0.09/0.31 inference(resolution,[status(thm)],[f25,f14])).
% 0.09/0.31 fof(f41,plain,(
% 0.09/0.31 ![X0]: (is_a_theorem(implies(X0,X0)))),
% 0.09/0.31 inference(resolution,[status(thm)],[f25,f10])).
% 0.09/0.31 fof(f46,plain,(
% 0.09/0.31 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(implies(not(X1),X2)))),
% 0.09/0.31 inference(resolution,[status(thm)],[f28,f7])).
% 0.09/0.31 fof(f47,plain,(
% 0.09/0.31 ~is_a_theorem(implies(not(implies(implies(not(y),y),y)),x))),
% 0.09/0.31 inference(resolution,[status(thm)],[f40,f11])).
% 0.09/0.31 fof(f54,plain,(
% 0.09/0.31 spl0_4 <=> ~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(implies(not(X1),X2))),
% 0.09/0.31 introduced(split_symbol_definition)).
% 0.09/0.31 fof(f55,plain,(
% 0.09/0.31 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(implies(not(X1),X2))|~spl0_4)),
% 0.09/0.31 inference(component_clause,[status(thm)],[f54])).
% 0.09/0.31 fof(f57,plain,(
% 0.09/0.31 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(implies(not(X1),X2))|~is_a_theorem(X3))),
% 0.09/0.31 inference(resolution,[status(thm)],[f46,f24])).
% 0.09/0.31 fof(f58,plain,(
% 0.09/0.31 spl0_4|spl0_3),
% 0.09/0.31 inference(split_clause,[status(thm)],[f57,f54,f32])).
% 0.14/0.54 fof(f114,plain,(
% 0.14/0.54 $false|~spl0_3),
% 0.14/0.54 inference(backward_subsumption_resolution,[status(thm)],[f9,f33])).
% 0.14/0.54 fof(f115,plain,(
% 0.14/0.54 ~spl0_3),
% 0.14/0.54 inference(contradiction_clause,[status(thm)],[f114])).
% 0.14/0.54 fof(f130,plain,(
% 0.14/0.54 ![X0]: (~is_a_theorem(implies(X0,implies(implies(not(y),y),y)))|~is_a_theorem(X0)|~spl0_4)),
% 0.14/0.54 inference(resolution,[status(thm)],[f47,f55])).
% 0.14/0.54 fof(f132,plain,(
% 0.14/0.54 ~is_a_theorem(implies(implies(not(y),y),y))|~spl0_4),
% 0.14/0.54 inference(resolution,[status(thm)],[f130,f41])).
% 0.14/0.54 fof(f133,plain,(
% 0.14/0.54 $false|~spl0_4),
% 0.14/0.54 inference(forward_subsumption_resolution,[status(thm)],[f132,f9])).
% 0.14/0.54 fof(f134,plain,(
% 0.14/0.54 ~spl0_4),
% 0.14/0.54 inference(contradiction_clause,[status(thm)],[f133])).
% 0.14/0.54 fof(f135,plain,(
% 0.14/0.54 $false),
% 0.14/0.54 inference(sat_refutation,[status(thm)],[f58,f115,f134])).
% 0.14/0.54 % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.54 % Elapsed time: 0.025080 seconds
% 0.14/0.54 % CPU time: 0.022710 seconds
% 0.14/0.54 % Memory used: 1.937 MB
%------------------------------------------------------------------------------