TSTP Solution File: LCL118-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL118-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n006.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:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL118-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 09:38:32 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.20/0.36 % Refutation found
% 0.20/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.36 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.36 fof(f1,axiom,(
% 0.20/0.36 (![X,Y]: (( ~ is_a_theorem(equivalent(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f2,axiom,(
% 0.20/0.36 (![X,Y,Z]: (is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,equivalent(Y,X)))) ))),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f3,negated_conjecture,(
% 0.20/0.36 ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))) ),
% 0.20/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.36 fof(f4,plain,(
% 0.20/0.36 ![Y]: ((![X]: (~is_a_theorem(equivalent(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.20/0.36 inference(miniscoping,[status(esa)],[f1])).
% 0.20/0.36 fof(f5,plain,(
% 0.20/0.36 ![X0,X1]: (~is_a_theorem(equivalent(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f4])).
% 0.20/0.36 fof(f6,plain,(
% 0.20/0.36 ![X0,X1,X2]: (is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f2])).
% 0.20/0.36 fof(f7,plain,(
% 0.20/0.36 ~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a))))),
% 0.20/0.36 inference(cnf_transformation,[status(esa)],[f3])).
% 0.20/0.36 fof(f8,plain,(
% 0.20/0.36 ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,equivalent(X1,X2)))|is_a_theorem(equivalent(X2,equivalent(X1,X0))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f6,f5])).
% 0.20/0.36 fof(f9,plain,(
% 0.20/0.36 ~is_a_theorem(equivalent(equivalent(c,a),equivalent(equivalent(c,b),equivalent(a,b))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f8,f7])).
% 0.20/0.36 fof(f10,plain,(
% 0.20/0.36 ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,equivalent(X1,X2)))|~is_a_theorem(X2)|is_a_theorem(equivalent(X1,X0)))),
% 0.20/0.36 inference(resolution,[status(thm)],[f8,f5])).
% 0.20/0.36 fof(f12,plain,(
% 0.20/0.36 ![X0,X1,X2]: (~is_a_theorem(equivalent(X0,X1))|is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X0,X2)))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f10,f6])).
% 0.20/0.36 fof(f14,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),X0)))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f12,f6])).
% 0.20/0.36 fof(f15,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X0))))|~is_a_theorem(equivalent(X2,equivalent(X1,X3))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f12,f8])).
% 0.20/0.36 fof(f16,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (~is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X3))|is_a_theorem(equivalent(equivalent(X2,equivalent(X1,X0)),X3)))),
% 0.20/0.36 inference(resolution,[status(thm)],[f14,f10])).
% 0.20/0.36 fof(f19,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0)))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f15,f6])).
% 0.20/0.36 fof(f23,plain,(
% 0.20/0.36 ![X0,X1,X2,X3,X4]: (~is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,X4)))|~is_a_theorem(X4)|is_a_theorem(equivalent(X3,equivalent(X2,equivalent(X1,X0)))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f16,f10])).
% 0.20/0.36 fof(f27,plain,(
% 0.20/0.36 spl0_0 <=> ~is_a_theorem(X0)|~is_a_theorem(X0)),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f28,plain,(
% 0.20/0.36 ![X0]: (~is_a_theorem(X0)|~is_a_theorem(X0)|~spl0_0)),
% 0.20/0.36 inference(component_clause,[status(thm)],[f27])).
% 0.20/0.36 fof(f37,plain,(
% 0.20/0.36 ![X0]: (~is_a_theorem(X0)|~spl0_0)),
% 0.20/0.36 inference(duplicate_literals_removal,[status(esa)],[f28])).
% 0.20/0.36 fof(f39,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (~is_a_theorem(equivalent(equivalent(X0,X1),X2))|is_a_theorem(equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2)))),
% 0.20/0.36 inference(resolution,[status(thm)],[f19,f10])).
% 0.20/0.36 fof(f41,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (~is_a_theorem(X0)|is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f19,f5])).
% 0.20/0.36 fof(f55,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X0))),equivalent(X2,equivalent(X1,X3)))))),
% 0.20/0.36 inference(resolution,[status(thm)],[f39,f6])).
% 0.20/0.36 fof(f297,plain,(
% 0.20/0.36 spl0_10 <=> is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3))))),
% 0.20/0.36 introduced(split_symbol_definition)).
% 0.20/0.36 fof(f298,plain,(
% 0.20/0.36 ![X0,X1,X2]: (is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2))))|~spl0_10)),
% 0.20/0.36 inference(component_clause,[status(thm)],[f297])).
% 0.20/0.36 fof(f300,plain,(
% 0.20/0.36 ![X0,X1,X2,X3]: (~is_a_theorem(X0)|is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3))))|~is_a_theorem(X0))),
% 0.20/0.36 inference(resolution,[status(thm)],[f23,f41])).
% 0.20/0.36 fof(f301,plain,(
% 0.20/0.36 spl0_0|spl0_10),
% 0.20/0.36 inference(split_clause,[status(thm)],[f300,f27,f297])).
% 0.20/0.36 fof(f339,plain,(
% 0.20/0.36 $false|~spl0_0),
% 0.20/0.36 inference(backward_subsumption_resolution,[status(thm)],[f55,f37])).
% 0.20/0.36 fof(f340,plain,(
% 0.20/0.36 ~spl0_0),
% 0.20/0.36 inference(contradiction_clause,[status(thm)],[f339])).
% 0.20/0.36 fof(f343,plain,(
% 0.20/0.36 $false|~spl0_10),
% 0.20/0.36 inference(forward_subsumption_resolution,[status(thm)],[f9,f298])).
% 0.20/0.36 fof(f344,plain,(
% 0.20/0.36 ~spl0_10),
% 0.20/0.36 inference(contradiction_clause,[status(thm)],[f343])).
% 0.20/0.36 fof(f345,plain,(
% 0.20/0.36 $false),
% 0.20/0.36 inference(sat_refutation,[status(thm)],[f301,f340,f344])).
% 0.20/0.36 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.38 % Elapsed time: 0.036240 seconds
% 0.20/0.38 % CPU time: 0.075237 seconds
% 0.20/0.38 % Memory used: 7.176 MB
%------------------------------------------------------------------------------