TSTP Solution File: LCL004-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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:00 EDT 2023
% Result : Unsatisfiable 0.10s 0.55s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : LCL004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n010.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 30 09:32:37 EDT 2023
% 0.07/0.26 % CPUTime :
% 0.07/0.27 % Drodi V3.5.1
% 0.10/0.55 % Refutation found
% 0.10/0.55 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.55 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.55 fof(f1,axiom,(
% 0.10/0.55 (![X,Y]: (( ~ is_a_theorem(or(not(X),Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.10/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.55 fof(f2,axiom,(
% 0.10/0.55 (![X,Y,Z,U,V]: (is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))) ))),
% 0.10/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.55 fof(f3,negated_conjecture,(
% 0.10/0.55 ~ is_a_theorem(or(not(a),or(b,a))) ),
% 0.10/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.55 fof(f4,plain,(
% 0.10/0.55 ![Y]: ((![X]: (~is_a_theorem(or(not(X),Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.10/0.55 inference(miniscoping,[status(esa)],[f1])).
% 0.10/0.55 fof(f5,plain,(
% 0.10/0.55 ![X0,X1]: (~is_a_theorem(or(not(X0),X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.10/0.55 inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.55 fof(f6,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))))),
% 0.10/0.55 inference(cnf_transformation,[status(esa)],[f2])).
% 0.10/0.55 fof(f7,plain,(
% 0.10/0.55 ~is_a_theorem(or(not(a),or(b,a)))),
% 0.10/0.55 inference(cnf_transformation,[status(esa)],[f3])).
% 0.10/0.55 fof(f8,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4))))|is_a_theorem(or(not(or(not(X3),X0)),or(X2,or(X4,X0)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f6,f5])).
% 0.10/0.55 fof(f9,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4))))|~is_a_theorem(or(not(X3),X0))|is_a_theorem(or(X2,or(X4,X0))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f8,f5])).
% 0.10/0.55 fof(f10,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6,X7]: (~is_a_theorem(or(not(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X1)))),X4)),or(X5,or(or(not(or(not(X1),X6)),or(X2,or(X0,X3))),X7))))|is_a_theorem(or(X5,or(X7,or(not(or(not(X0),X1)),or(X2,or(X3,X1)))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f9,f6])).
% 0.10/0.55 fof(f11,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6,X7]: (~is_a_theorem(or(not(or(not(or(X0,or(X1,X2))),X3)),or(X4,or(or(not(X5),X2),X6))))|is_a_theorem(or(X4,or(X6,or(X0,or(X1,X2)))))|~is_a_theorem(or(not(or(not(X2),X7)),or(X0,or(X5,X1)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f9,f8])).
% 0.10/0.55 fof(f13,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6,X7]: (is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(X4,or(X5,X3))))))|~is_a_theorem(or(not(or(not(X1),X6)),or(X0,or(or(not(or(not(X2),X3)),or(X4,or(X5,X3))),or(not(or(not(X3),X7)),or(X4,or(X2,X5))))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f10,f8])).
% 0.10/0.55 fof(f17,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6,X7]: (is_a_theorem(or(X0,or(X1,or(X2,or(X3,X4)))))|~is_a_theorem(or(not(or(not(X4),X5)),or(X2,or(X6,X3))))|~is_a_theorem(or(not(or(not(X1),X7)),or(X0,or(or(X2,or(X3,X4)),or(not(X6),X4))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f11,f8])).
% 0.10/0.55 fof(f20,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6]: (is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X1),X2),or(X3,or(X4,X1)))))|~is_a_theorem(or(not(or(not(X1),X5)),or(X3,or(X6,X4)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f17,f6])).
% 0.10/0.55 fof(f25,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6]: (is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X1),X2),or(X3,or(X4,X1)))))|~is_a_theorem(or(not(or(not(X4),X5)),or(X3,or(X1,X6)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f20,f8])).
% 0.10/0.55 fof(f37,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5,X6,X7]: (is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(X4,or(X5,X3))))))|~is_a_theorem(or(not(or(not(or(not(or(not(X3),X6)),or(X4,or(X2,X5)))),X7)),or(X0,or(X1,or(not(or(not(X2),X3)),or(X4,or(X5,X3))))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f13,f8])).
% 0.10/0.55 fof(f115,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (is_a_theorem(or(not(or(not(X0),or(not(X1),or(X2,X1)))),or(X3,or(not(or(not(X4),X1)),or(not(X1),or(X2,X1)))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f37,f6])).
% 0.10/0.55 fof(f121,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (is_a_theorem(or(X0,or(not(or(not(X1),or(not(X2),X3))),or(not(or(not(X2),X3)),or(X4,or(not(X2),X3)))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f115,f37])).
% 0.10/0.55 fof(f125,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5]: (is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X1),X2),or(X3,or(or(not(X4),or(X5,X4)),X1))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f115,f20])).
% 0.10/0.55 fof(f132,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5]: (is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X1),X2),or(or(not(X3),X4),or(X5,X1))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f125,f25])).
% 0.10/0.55 fof(f140,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5]: (is_a_theorem(or(or(not(or(X0,or(X1,X2))),X3),or(X4,or(not(or(not(X1),X5)),or(X0,or(X2,X5)))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f132,f13])).
% 0.10/0.55 fof(f153,plain,(
% 0.10/0.55 spl0_0 <=> ~is_a_theorem(X0)),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f154,plain,(
% 0.10/0.55 ![X0]: (~is_a_theorem(X0)|~spl0_0)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f153])).
% 0.10/0.55 fof(f156,plain,(
% 0.10/0.55 spl0_1 <=> is_a_theorem(or(not(or(not(X1),or(not(X2),X3))),or(not(or(not(X2),X3)),or(X4,or(not(X2),X3)))))),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f157,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (is_a_theorem(or(not(or(not(X0),or(not(X1),X2))),or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))))|~spl0_1)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f156])).
% 0.10/0.55 fof(f159,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(X0)|is_a_theorem(or(not(or(not(X1),or(not(X2),X3))),or(not(or(not(X2),X3)),or(X4,or(not(X2),X3))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f121,f5])).
% 0.10/0.55 fof(f160,plain,(
% 0.10/0.55 spl0_0|spl0_1),
% 0.10/0.55 inference(split_clause,[status(thm)],[f159,f153,f156])).
% 0.10/0.55 fof(f161,plain,(
% 0.10/0.55 $false|~spl0_0),
% 0.10/0.55 inference(backward_subsumption_resolution,[status(thm)],[f140,f154])).
% 0.10/0.55 fof(f162,plain,(
% 0.10/0.55 ~spl0_0),
% 0.10/0.55 inference(contradiction_clause,[status(thm)],[f161])).
% 0.10/0.55 fof(f210,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5]: (is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X2),X3),or(or(or(not(X4),or(X5,X4)),X2),X1)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f8,f125])).
% 0.10/0.55 fof(f220,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (is_a_theorem(or(not(or(not(X0),or(not(X1),X2))),or(not(or(not(X3),X1)),or(or(X4,X1),or(not(X1),X2))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f6,f8])).
% 0.10/0.55 fof(f228,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4,X5]: (is_a_theorem(or(not(or(not(or(or(not(X0),or(X1,X0)),X2)),X3)),or(or(not(X2),X4),or(X5,X3)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f210,f8])).
% 0.10/0.55 fof(f254,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (is_a_theorem(or(not(or(not(or(X0,X1)),X2)),or(not(or(not(X3),X1)),or(or(not(X1),X4),X2)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f220,f8])).
% 0.10/0.55 fof(f275,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,X0))),or(not(or(not(X3),X0)),or(X4,or(X2,X0))))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f254,f8])).
% 0.10/0.55 fof(f303,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|is_a_theorem(or(not(or(not(X3),X0)),or(X4,or(X2,X0)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f275,f5])).
% 0.10/0.55 fof(f308,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|is_a_theorem(or(not(or(not(X2),X3)),or(X4,or(X0,X3)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f303,f8])).
% 0.10/0.55 fof(f315,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X3),X0))|is_a_theorem(or(X4,or(X2,X0))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f303,f5])).
% 0.10/0.55 fof(f335,plain,(
% 0.10/0.55 spl0_5 <=> ~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X3),X0))|is_a_theorem(or(X2,X0))),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f336,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X3),X0))|is_a_theorem(or(X2,X0))|~spl0_5)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f335])).
% 0.10/0.55 fof(f338,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X3),X0))|~is_a_theorem(X4)|is_a_theorem(or(X2,X0)))),
% 0.10/0.55 inference(resolution,[status(thm)],[f315,f5])).
% 0.10/0.55 fof(f339,plain,(
% 0.10/0.55 spl0_5|spl0_0),
% 0.10/0.55 inference(split_clause,[status(thm)],[f338,f335,f153])).
% 0.10/0.55 fof(f344,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|is_a_theorem(or(not(or(not(X0),X2)),or(X3,or(X4,X2)))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f308,f8])).
% 0.10/0.55 fof(f381,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|is_a_theorem(or(X3,or(X4,X2))))),
% 0.10/0.55 inference(resolution,[status(thm)],[f344,f5])).
% 0.10/0.55 fof(f395,plain,(
% 0.10/0.55 spl0_7 <=> ~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|is_a_theorem(or(X4,X2))),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f396,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|is_a_theorem(or(X3,X2))|~spl0_7)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f395])).
% 0.10/0.55 fof(f398,plain,(
% 0.10/0.55 ![X0,X1,X2,X3,X4]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|~is_a_theorem(X3)|is_a_theorem(or(X4,X2)))),
% 0.10/0.55 inference(resolution,[status(thm)],[f381,f5])).
% 0.10/0.55 fof(f399,plain,(
% 0.10/0.55 spl0_7|spl0_0),
% 0.10/0.55 inference(split_clause,[status(thm)],[f398,f395,f153])).
% 0.10/0.55 fof(f444,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (~is_a_theorem(or(not(X0),or(not(X1),or(X2,X1))))|is_a_theorem(or(not(or(not(X3),X1)),or(not(X1),or(X2,X1))))|~spl0_5)),
% 0.10/0.55 inference(resolution,[status(thm)],[f336,f6])).
% 0.10/0.55 fof(f538,plain,(
% 0.10/0.55 spl0_14 <=> ~is_a_theorem(or(not(or(not(X2),X3)),or(X4,X2)))),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f539,plain,(
% 0.10/0.55 ![X0,X1,X2]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~spl0_14)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f538])).
% 0.10/0.55 fof(f555,plain,(
% 0.10/0.55 spl0_16 <=> ~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|is_a_theorem(X2)),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f556,plain,(
% 0.10/0.55 ![X0,X1,X2]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|is_a_theorem(X2)|~spl0_16)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f555])).
% 0.10/0.55 fof(f558,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (~is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))|~is_a_theorem(or(not(X0),X2))|~is_a_theorem(X3)|is_a_theorem(X2)|~spl0_7)),
% 0.10/0.55 inference(resolution,[status(thm)],[f396,f5])).
% 0.10/0.55 fof(f559,plain,(
% 0.10/0.55 spl0_16|spl0_0|~spl0_7),
% 0.10/0.55 inference(split_clause,[status(thm)],[f558,f555,f153,f395])).
% 0.10/0.55 fof(f577,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (~is_a_theorem(or(not(or(X0,X1)),X2))|is_a_theorem(X2)|~is_a_theorem(or(not(or(not(X1),X3)),or(X0,X1)))|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f556,f303])).
% 0.10/0.55 fof(f591,plain,(
% 0.10/0.55 ![X0,X1,X2,X3]: (~is_a_theorem(or(not(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1)))),X3))|is_a_theorem(X3)|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f577,f6])).
% 0.10/0.55 fof(f614,plain,(
% 0.10/0.55 ![X0,X1,X2]: (is_a_theorem(or(not(or(not(X0),X1)),or(not(X2),or(X2,X1))))|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f591,f6])).
% 0.10/0.55 fof(f655,plain,(
% 0.10/0.55 ![X0,X1,X2]: (~is_a_theorem(or(not(or(not(X0),or(X0,X1))),X2))|is_a_theorem(X2)|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f614,f577])).
% 0.10/0.55 fof(f687,plain,(
% 0.10/0.55 spl0_19 <=> is_a_theorem(or(not(X3),or(X4,X3)))),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f688,plain,(
% 0.10/0.55 ![X0,X1]: (is_a_theorem(or(not(X0),or(X1,X0)))|~spl0_19)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f687])).
% 0.10/0.55 fof(f738,plain,(
% 0.10/0.55 $false|~spl0_19),
% 0.10/0.55 inference(backward_subsumption_resolution,[status(thm)],[f7,f688])).
% 0.10/0.55 fof(f739,plain,(
% 0.10/0.55 ~spl0_19),
% 0.10/0.55 inference(contradiction_clause,[status(thm)],[f738])).
% 0.10/0.55 fof(f749,plain,(
% 0.10/0.55 ![X0,X1,X2]: (is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(not(X0),X1))))|~spl0_16|~spl0_1)),
% 0.10/0.55 inference(resolution,[status(thm)],[f655,f157])).
% 0.10/0.55 fof(f751,plain,(
% 0.10/0.55 ![X0,X1,X2]: (is_a_theorem(or(not(X0),or(X0,or(X1,X2))))|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f655,f614])).
% 0.10/0.55 fof(f782,plain,(
% 0.10/0.55 ![X0,X1,X2]: (is_a_theorem(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1))))|~spl0_16|~spl0_5)),
% 0.10/0.55 inference(resolution,[status(thm)],[f751,f444])).
% 0.10/0.55 fof(f941,plain,(
% 0.10/0.55 $false|~spl0_14),
% 0.10/0.55 inference(resolution,[status(thm)],[f539,f228])).
% 0.10/0.55 fof(f942,plain,(
% 0.10/0.55 ~spl0_14),
% 0.10/0.55 inference(contradiction_clause,[status(thm)],[f941])).
% 0.10/0.55 fof(f950,plain,(
% 0.10/0.55 spl0_37 <=> ~is_a_theorem(or(not(X0),or(b,a)))),
% 0.10/0.55 introduced(split_symbol_definition)).
% 0.10/0.55 fof(f951,plain,(
% 0.10/0.55 ![X0]: (~is_a_theorem(or(not(X0),or(b,a)))|~spl0_37)),
% 0.10/0.55 inference(component_clause,[status(thm)],[f950])).
% 0.10/0.55 fof(f1042,plain,(
% 0.10/0.55 ![X0,X1,X2]: (is_a_theorem(or(X0,or(not(X1),or(X1,X2))))|~spl0_1|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f749,f655])).
% 0.10/0.55 fof(f1046,plain,(
% 0.10/0.55 ![X0,X1]: (is_a_theorem(or(not(X0),or(X0,X1)))|~spl0_1|~spl0_16)),
% 0.10/0.55 inference(resolution,[status(thm)],[f1042,f655])).
% 0.10/0.56 fof(f1053,plain,(
% 0.10/0.56 $false|~spl0_1|~spl0_16|~spl0_37),
% 0.10/0.56 inference(resolution,[status(thm)],[f1046,f951])).
% 0.10/0.56 fof(f1054,plain,(
% 0.10/0.56 ~spl0_1|~spl0_16|~spl0_37),
% 0.10/0.56 inference(contradiction_clause,[status(thm)],[f1053])).
% 0.10/0.56 fof(f1057,plain,(
% 0.10/0.56 ![X0,X1,X2]: (~is_a_theorem(or(not(X0),or(X1,X2)))|is_a_theorem(or(not(X2),or(X1,X2)))|~spl0_16|~spl0_5)),
% 0.10/0.56 inference(resolution,[status(thm)],[f782,f336])).
% 0.10/0.56 fof(f1318,plain,(
% 0.10/0.56 spl0_56 <=> is_a_theorem(X2)),
% 0.10/0.56 introduced(split_symbol_definition)).
% 0.10/0.56 fof(f1319,plain,(
% 0.10/0.56 ![X0]: (is_a_theorem(X0)|~spl0_56)),
% 0.10/0.56 inference(component_clause,[status(thm)],[f1318])).
% 0.10/0.56 fof(f1328,plain,(
% 0.10/0.56 $false|~spl0_56),
% 0.10/0.56 inference(backward_subsumption_resolution,[status(thm)],[f7,f1319])).
% 0.10/0.56 fof(f1329,plain,(
% 0.10/0.56 ~spl0_56),
% 0.10/0.56 inference(contradiction_clause,[status(thm)],[f1328])).
% 0.10/0.56 fof(f1770,plain,(
% 0.10/0.56 ![X0]: (~is_a_theorem(or(not(X0),or(b,a)))|~spl0_16|~spl0_5)),
% 0.10/0.56 inference(resolution,[status(thm)],[f1057,f7])).
% 0.10/0.56 fof(f1771,plain,(
% 0.10/0.56 spl0_37|~spl0_16|~spl0_5),
% 0.10/0.56 inference(split_clause,[status(thm)],[f1770,f950,f555,f335])).
% 0.10/0.56 fof(f1779,plain,(
% 0.10/0.56 $false),
% 0.10/0.56 inference(sat_refutation,[status(thm)],[f160,f162,f339,f399,f559,f739,f942,f1054,f1329,f1771])).
% 0.10/0.56 % SZS output end CNFRefutation for theBenchmark.p
% 2.25/0.59 % Elapsed time: 0.319523 seconds
% 2.25/0.59 % CPU time: 2.363108 seconds
% 2.25/0.59 % Memory used: 87.867 MB
%------------------------------------------------------------------------------