TSTP Solution File: LCL268-3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n020.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:54 EDT 2023
% Result : Unsatisfiable 0.16s 0.37s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL268-3 : TPTP v8.1.2. Released v2.3.0.
% 0.10/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue May 30 09:42:43 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.5.1
% 0.16/0.37 % Refutation found
% 0.16/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.37 % SZS output start CNFRefutation for theBenchmark
% 0.16/0.37 fof(f1,axiom,(
% 0.16/0.37 (![A]: (axiom(implies(or(A,A),A)) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f2,axiom,(
% 0.16/0.37 (![A,B]: (axiom(implies(A,or(B,A))) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f3,axiom,(
% 0.16/0.37 (![A,B]: (axiom(implies(or(A,B),or(B,A))) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f4,axiom,(
% 0.16/0.37 (![A,B,C]: (axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f6,axiom,(
% 0.16/0.37 (![X,Y]: (implies(X,Y) = or(not(X),Y) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f7,axiom,(
% 0.16/0.37 (![X]: (( theorem(X)| ~ axiom(X) ) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f8,axiom,(
% 0.16/0.37 (![X,Y]: (( theorem(X)| ~ theorem(implies(Y,X))| ~ theorem(Y) ) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f9,axiom,(
% 0.16/0.37 (![P,Q]: (and(P,Q) = not(or(not(P),not(Q))) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f10,axiom,(
% 0.16/0.37 (![P,Q]: (equivalent(P,Q) = and(implies(P,Q),implies(Q,P)) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f11,negated_conjecture,(
% 0.16/0.37 ~ theorem(equivalent(p,p)) ),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f12,plain,(
% 0.16/0.37 ![X0]: (axiom(implies(or(X0,X0),X0)))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f1])).
% 0.16/0.37 fof(f13,plain,(
% 0.16/0.37 ![X0,X1]: (axiom(implies(X0,or(X1,X0))))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f2])).
% 0.16/0.37 fof(f14,plain,(
% 0.16/0.37 ![X0,X1]: (axiom(implies(or(X0,X1),or(X1,X0))))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f3])).
% 0.16/0.37 fof(f15,plain,(
% 0.16/0.37 ![X0,X1,X2]: (axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f4])).
% 0.16/0.37 fof(f17,plain,(
% 0.16/0.37 ![X0,X1]: (implies(X0,X1)=or(not(X0),X1))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f6])).
% 0.16/0.37 fof(f18,plain,(
% 0.16/0.37 ![X0]: (theorem(X0)|~axiom(X0))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f7])).
% 0.16/0.37 fof(f19,plain,(
% 0.16/0.37 ![Y]: ((![X]: (theorem(X)|~theorem(implies(Y,X))))|~theorem(Y))),
% 0.16/0.37 inference(miniscoping,[status(esa)],[f8])).
% 0.16/0.37 fof(f20,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(X0)|~theorem(implies(X1,X0))|~theorem(X1))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f19])).
% 0.16/0.37 fof(f21,plain,(
% 0.16/0.37 ![X0,X1]: (and(X0,X1)=not(or(not(X0),not(X1))))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f9])).
% 0.16/0.37 fof(f22,plain,(
% 0.16/0.37 ![X0,X1]: (equivalent(X0,X1)=and(implies(X0,X1),implies(X1,X0)))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f10])).
% 0.16/0.37 fof(f23,plain,(
% 0.16/0.37 ~theorem(equivalent(p,p))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f11])).
% 0.16/0.37 fof(f24,plain,(
% 0.16/0.37 ![X0]: (theorem(implies(or(X0,X0),X0)))),
% 0.16/0.37 inference(resolution,[status(thm)],[f12,f18])).
% 0.16/0.37 fof(f25,plain,(
% 0.16/0.37 ![X0]: (theorem(X0)|~theorem(or(X0,X0)))),
% 0.16/0.37 inference(resolution,[status(thm)],[f24,f20])).
% 0.16/0.37 fof(f26,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(implies(X0,or(X1,X0))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f13,f18])).
% 0.16/0.37 fof(f27,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(X0,X1))|~theorem(X1))),
% 0.16/0.37 inference(resolution,[status(thm)],[f26,f20])).
% 0.16/0.37 fof(f28,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(X0,implies(or(X1,X1),X1))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f27,f24])).
% 0.16/0.37 fof(f29,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(X0,implies(X1,or(X2,X1)))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f27,f26])).
% 0.16/0.37 fof(f31,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(X0,or(X1,implies(or(X2,X2),X2)))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f28,f27])).
% 0.16/0.37 fof(f35,plain,(
% 0.16/0.37 ![X0,X1,X2,X3]: (theorem(or(X0,or(X1,or(X2,implies(or(X3,X3),X3))))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f31,f27])).
% 0.16/0.37 fof(f39,plain,(
% 0.16/0.37 ![X0,X1,X2,X3,X4]: (theorem(or(X0,or(X1,or(X2,or(X3,implies(or(X4,X4),X4)))))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f35,f27])).
% 0.16/0.37 fof(f65,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(implies(X0,implies(X1,or(X2,X1)))))),
% 0.16/0.37 inference(paramodulation,[status(thm)],[f17,f29])).
% 0.16/0.37 fof(f77,plain,(
% 0.16/0.37 ![X0]: (theorem(implies(implies(X0,not(X0)),not(X0))))),
% 0.16/0.37 inference(paramodulation,[status(thm)],[f17,f24])).
% 0.16/0.37 fof(f93,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(implies(or(X0,X1),or(X1,X0))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f14,f18])).
% 0.16/0.37 fof(f99,plain,(
% 0.16/0.37 spl0_1 <=> ~theorem(X1)),
% 0.16/0.37 introduced(split_symbol_definition)).
% 0.16/0.37 fof(f100,plain,(
% 0.16/0.37 ![X0]: (~theorem(X0)|~spl0_1)),
% 0.16/0.37 inference(component_clause,[status(thm)],[f99])).
% 0.16/0.37 fof(f107,plain,(
% 0.16/0.37 spl0_2 <=> theorem(implies(X0,or(X1,X0)))),
% 0.16/0.37 introduced(split_symbol_definition)).
% 0.16/0.37 fof(f108,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(implies(X0,or(X1,X0)))|~spl0_2)),
% 0.16/0.37 inference(component_clause,[status(thm)],[f107])).
% 0.16/0.37 fof(f110,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(implies(X0,or(X1,X0)))|~theorem(X2))),
% 0.16/0.37 inference(resolution,[status(thm)],[f65,f20])).
% 0.16/0.37 fof(f111,plain,(
% 0.16/0.37 spl0_2|spl0_1),
% 0.16/0.37 inference(split_clause,[status(thm)],[f110,f107,f99])).
% 0.16/0.37 fof(f116,plain,(
% 0.16/0.37 $false|~spl0_1),
% 0.16/0.37 inference(backward_subsumption_resolution,[status(thm)],[f39,f100])).
% 0.16/0.37 fof(f117,plain,(
% 0.16/0.37 ~spl0_1),
% 0.16/0.37 inference(contradiction_clause,[status(thm)],[f116])).
% 0.16/0.37 fof(f129,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f15,f18])).
% 0.16/0.37 fof(f143,plain,(
% 0.16/0.37 ![X0,X1]: (and(X0,X1)=not(implies(X0,not(X1))))),
% 0.16/0.37 inference(forward_demodulation,[status(thm)],[f17,f21])).
% 0.16/0.37 fof(f172,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(X0,X1))|~theorem(or(X1,X0)))),
% 0.16/0.37 inference(resolution,[status(thm)],[f93,f20])).
% 0.16/0.37 fof(f176,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(implies(or(X0,not(X1)),implies(X1,X0))))),
% 0.16/0.37 inference(paramodulation,[status(thm)],[f17,f93])).
% 0.16/0.37 fof(f186,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(X0,or(X1,X2)))|~theorem(or(X1,or(X0,X2))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f129,f20])).
% 0.16/0.37 fof(f200,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(X0,not(X1)))|~theorem(implies(X1,X0)))),
% 0.16/0.37 inference(paramodulation,[status(thm)],[f17,f172])).
% 0.16/0.37 fof(f246,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(implies(X0,X1))|~theorem(or(X1,not(X0))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f176,f20])).
% 0.16/0.37 fof(f251,plain,(
% 0.16/0.37 ![X0]: (theorem(or(not(X0),not(implies(X0,not(X0))))))),
% 0.16/0.37 inference(resolution,[status(thm)],[f200,f77])).
% 0.16/0.37 fof(f252,plain,(
% 0.16/0.37 ![X0]: (theorem(implies(X0,not(implies(X0,not(X0))))))),
% 0.16/0.37 inference(forward_demodulation,[status(thm)],[f17,f251])).
% 0.16/0.37 fof(f253,plain,(
% 0.16/0.37 ![X0]: (theorem(implies(X0,and(X0,X0))))),
% 0.16/0.37 inference(forward_demodulation,[status(thm)],[f143,f252])).
% 0.16/0.37 fof(f264,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(or(X0,X1),not(X1)))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f200,f108])).
% 0.16/0.37 fof(f269,plain,(
% 0.16/0.37 ![X0]: (theorem(implies(implies(X0,X0),equivalent(X0,X0))))),
% 0.16/0.37 inference(paramodulation,[status(thm)],[f22,f253])).
% 0.16/0.37 fof(f309,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(X0,or(or(X1,X2),not(X2))))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f264,f27])).
% 0.16/0.37 fof(f354,plain,(
% 0.16/0.37 ![X0]: (theorem(equivalent(X0,X0))|~theorem(implies(X0,X0)))),
% 0.16/0.37 inference(resolution,[status(thm)],[f269,f20])).
% 0.16/0.37 fof(f444,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(or(X0,X1),or(X2,not(X1))))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f309,f186])).
% 0.16/0.37 fof(f658,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(or(X0,not(X1)),or(X2,X1)))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f444,f172])).
% 0.16/0.37 fof(f760,plain,(
% 0.16/0.37 ![X0,X1,X2]: (theorem(or(X0,or(or(X1,not(X2)),X2)))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f658,f186])).
% 0.16/0.37 fof(f840,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(or(X0,not(X1)),X1))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f760,f25])).
% 0.16/0.37 fof(f851,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(X0,or(X1,not(X0))))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f840,f172])).
% 0.16/0.37 fof(f859,plain,(
% 0.16/0.37 ![X0,X1]: (theorem(or(X0,or(X1,not(X1))))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f851,f186])).
% 0.16/0.37 fof(f880,plain,(
% 0.16/0.37 ![X0]: (theorem(or(X0,not(X0)))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f859,f25])).
% 0.16/0.37 fof(f889,plain,(
% 0.16/0.37 ![X0]: (theorem(implies(X0,X0))|~spl0_2)),
% 0.16/0.37 inference(resolution,[status(thm)],[f880,f246])).
% 0.16/0.37 fof(f907,plain,(
% 0.16/0.37 ![X0]: (theorem(equivalent(X0,X0))|~spl0_2)),
% 0.16/0.37 inference(backward_subsumption_resolution,[status(thm)],[f354,f889])).
% 0.16/0.37 fof(f918,plain,(
% 0.16/0.37 $false|~spl0_2),
% 0.16/0.37 inference(backward_subsumption_resolution,[status(thm)],[f23,f907])).
% 0.16/0.37 fof(f919,plain,(
% 0.16/0.37 ~spl0_2),
% 0.16/0.37 inference(contradiction_clause,[status(thm)],[f918])).
% 0.16/0.37 fof(f920,plain,(
% 0.16/0.37 $false),
% 0.16/0.37 inference(sat_refutation,[status(thm)],[f111,f117,f919])).
% 0.16/0.37 % SZS output end CNFRefutation for theBenchmark.p
% 0.31/0.60 % Elapsed time: 0.060218 seconds
% 0.31/0.60 % CPU time: 0.115405 seconds
% 0.31/0.60 % Memory used: 12.556 MB
%------------------------------------------------------------------------------