TSTP Solution File: LCL239-10 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:48 EDT 2023
% Result : Unsatisfiable 1.53s 0.59s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 49 unt; 0 def)
% Number of atoms : 49 ( 48 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 97 (; 97 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B,C] : ifeq(A,A,B,C) = B,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(implies(A,or(B,A))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] : implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X] : ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [Y,X] : ifeq(theorem(implies(Y,X)),true,ifeq(theorem(Y),true,theorem(X),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,plain,
! [X0,X1,X2] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f14,plain,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f15,plain,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))) = true,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f16,plain,
! [X0,X1,X2] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f18,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f19,plain,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f20,plain,
! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f21,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f22,plain,
theorem(not(and(p,not(p)))) != true,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f23,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[status(thm)],[f18,f21]) ).
fof(f25,plain,
! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(paramodulation,[status(thm)],[f23,f18]) ).
fof(f356,plain,
! [X0,X1] : axiom(implies(X0,implies(X1,X0))) = true,
inference(paramodulation,[status(thm)],[f18,f14]) ).
fof(f390,plain,
! [X0,X1] : axiom(implies(implies(X0,X1),or(X1,not(X0)))) = true,
inference(paramodulation,[status(thm)],[f18,f15]) ).
fof(f395,plain,
! [X0,X1] : ifeq(true,true,theorem(implies(X0,implies(X1,X0))),true) = true,
inference(paramodulation,[status(thm)],[f356,f19]) ).
fof(f419,plain,
! [X0,X1] : ifeq(true,true,theorem(implies(implies(X0,X1),or(X1,not(X0)))),true) = true,
inference(paramodulation,[status(thm)],[f390,f19]) ).
fof(f543,plain,
! [X0,X1,X2] : ifeq(true,true,theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),true) = true,
inference(paramodulation,[status(thm)],[f16,f19]) ).
fof(f560,plain,
! [X0,X1,X2] : ifeq(theorem(or(and(X0,X1),X2)),true,ifeq(theorem(implies(X0,not(X1))),true,theorem(X2),true),true) = true,
inference(paramodulation,[status(thm)],[f25,f20]) ).
fof(f561,plain,
! [X0,X1] : theorem(implies(X0,implies(X1,X0))) = true,
inference(paramodulation,[status(thm)],[f12,f395]) ).
fof(f582,plain,
! [X0,X1,X2] : ifeq(theorem(implies(implies(X0,implies(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
inference(paramodulation,[status(thm)],[f561,f20]) ).
fof(f583,plain,
! [X0,X1,X2] : ifeq(theorem(implies(implies(X0,implies(X1,X0)),X2)),true,theorem(X2),true) = true,
inference(forward_demodulation,[status(thm)],[f12,f582]) ).
fof(f763,plain,
! [X0,X1] : theorem(implies(implies(X0,X1),or(X1,not(X0)))) = true,
inference(paramodulation,[status(thm)],[f12,f419]) ).
fof(f985,plain,
! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
inference(paramodulation,[status(thm)],[f12,f543]) ).
fof(f1264,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))) = true,
inference(paramodulation,[status(thm)],[f18,f985]) ).
fof(f1265,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) = true,
inference(forward_demodulation,[status(thm)],[f18,f1264]) ).
fof(f1307,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,implies(X1,X2)),or(not(X1),implies(X0,X2)))) = true,
inference(paramodulation,[status(thm)],[f18,f1265]) ).
fof(f1308,plain,
! [X0,X1,X2] : theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))) = true,
inference(forward_demodulation,[status(thm)],[f18,f1307]) ).
fof(f1713,plain,
! [X0,X1] : ifeq(true,true,theorem(implies(X0,implies(X1,X1))),true) = true,
inference(paramodulation,[status(thm)],[f1308,f583]) ).
fof(f1750,plain,
! [X0,X1] : theorem(implies(X0,implies(X1,X1))) = true,
inference(paramodulation,[status(thm)],[f12,f1713]) ).
fof(f1776,plain,
! [X0] : ifeq(true,true,theorem(implies(X0,X0)),true) = true,
inference(paramodulation,[status(thm)],[f1750,f583]) ).
fof(f1803,plain,
! [X0] : theorem(implies(X0,X0)) = true,
inference(paramodulation,[status(thm)],[f12,f1776]) ).
fof(f1829,plain,
! [X0,X1] : ifeq(theorem(implies(implies(X0,X0),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(paramodulation,[status(thm)],[f1803,f20]) ).
fof(f1830,plain,
! [X0,X1] : ifeq(theorem(implies(implies(X0,X0),X1)),true,theorem(X1),true) = true,
inference(forward_demodulation,[status(thm)],[f12,f1829]) ).
fof(f1939,plain,
! [X0] : ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
inference(paramodulation,[status(thm)],[f763,f1830]) ).
fof(f1984,plain,
! [X0] : theorem(or(X0,not(X0))) = true,
inference(paramodulation,[status(thm)],[f12,f1939]) ).
fof(f1993,plain,
! [X0] : theorem(implies(X0,not(not(X0)))) = true,
inference(paramodulation,[status(thm)],[f18,f1984]) ).
fof(f2028,plain,
! [X0,X1] : ifeq(theorem(or(and(X0,not(X0)),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(paramodulation,[status(thm)],[f1993,f560]) ).
fof(f2029,plain,
! [X0,X1] : ifeq(theorem(or(and(X0,not(X0)),X1)),true,theorem(X1),true) = true,
inference(forward_demodulation,[status(thm)],[f12,f2028]) ).
fof(f4599,plain,
! [X0] : ifeq(true,true,theorem(not(and(X0,not(X0)))),true) = true,
inference(paramodulation,[status(thm)],[f1984,f2029]) ).
fof(f4662,plain,
! [X0] : theorem(not(and(X0,not(X0)))) = true,
inference(paramodulation,[status(thm)],[f12,f4599]) ).
fof(f4671,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f22,f4662]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 10:02:04 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 1.53/0.59 % Refutation found
% 1.53/0.59 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.53/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.53/0.61 % Elapsed time: 0.260657 seconds
% 1.53/0.61 % CPU time: 1.951237 seconds
% 1.53/0.61 % Memory used: 59.256 MB
%------------------------------------------------------------------------------