TSTP Solution File: LCL154-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL154-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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 : Tue Apr 30 20:26:29 EDT 2024
% Result : Unsatisfiable 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 11
% Syntax : Number of formulae : 63 ( 63 unt; 0 def)
% Number of atoms : 63 ( 62 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 80 ( 80 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : implies(truth,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z] : implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y] : implies(implies(X,Y),Y) = implies(implies(Y,X),X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] : implies(implies(not(X),not(Y)),implies(Y,X)) = truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] : or(X,Y) = implies(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] : or(X,Y) = or(Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] : and(X,Y) = not(or(not(X),not(Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] : and(X,Y) = and(Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] : xor(X,Y) = or(and(X,not(Y)),and(not(X),Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
xor(x,falsehood) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,plain,
! [X0] : implies(truth,X0) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f19,plain,
! [X0,X1,X2] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f20,plain,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f21,plain,
! [X0,X1] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f22,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f24,plain,
! [X0,X1] : or(X0,X1) = or(X1,X0),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f25,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f27,plain,
! [X0,X1] : and(X0,X1) = and(X1,X0),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f28,plain,
! [X0,X1] : xor(X0,X1) = or(and(X0,not(X1)),and(not(X0),X1)),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f33,plain,
not(truth) = falsehood,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f34,plain,
xor(x,falsehood) != x,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f49,plain,
! [X0,X1] : implies(X0,implies(implies(X0,X1),implies(truth,X1))) = truth,
inference(paramodulation,[status(thm)],[f18,f19]) ).
fof(f50,plain,
! [X0,X1] : implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(forward_demodulation,[status(thm)],[f18,f49]) ).
fof(f75,plain,
! [X0,X1] : xor(X0,X1) = or(and(X0,not(X1)),and(X1,not(X0))),
inference(paramodulation,[status(thm)],[f27,f28]) ).
fof(f90,plain,
! [X0] : or(truth,X0) = implies(falsehood,X0),
inference(paramodulation,[status(thm)],[f33,f22]) ).
fof(f98,plain,
! [X0] : or(X0,truth) = implies(falsehood,X0),
inference(paramodulation,[status(thm)],[f24,f90]) ).
fof(f108,plain,
! [X0] : implies(implies(truth,X0),X0) = truth,
inference(paramodulation,[status(thm)],[f18,f50]) ).
fof(f109,plain,
! [X0] : implies(X0,X0) = truth,
inference(forward_demodulation,[status(thm)],[f18,f108]) ).
fof(f110,plain,
! [X0,X1] : implies(X0,implies(implies(X1,X0),X0)) = truth,
inference(paramodulation,[status(thm)],[f20,f50]) ).
fof(f136,plain,
! [X0] : or(X0,not(X0)) = truth,
inference(paramodulation,[status(thm)],[f22,f109]) ).
fof(f153,plain,
! [X0,X1] : implies(or(X0,not(X1)),implies(X1,X0)) = truth,
inference(forward_demodulation,[status(thm)],[f22,f21]) ).
fof(f159,plain,
! [X0] : implies(or(X0,falsehood),implies(truth,X0)) = truth,
inference(paramodulation,[status(thm)],[f33,f153]) ).
fof(f160,plain,
! [X0] : implies(or(X0,falsehood),X0) = truth,
inference(forward_demodulation,[status(thm)],[f18,f159]) ).
fof(f263,plain,
! [X0] : implies(or(falsehood,X0),X0) = truth,
inference(paramodulation,[status(thm)],[f24,f160]) ).
fof(f301,plain,
implies(truth,not(falsehood)) = truth,
inference(paramodulation,[status(thm)],[f136,f263]) ).
fof(f302,plain,
not(falsehood) = truth,
inference(forward_demodulation,[status(thm)],[f18,f301]) ).
fof(f328,plain,
! [X0] : or(falsehood,X0) = implies(truth,X0),
inference(paramodulation,[status(thm)],[f302,f22]) ).
fof(f329,plain,
! [X0] : or(falsehood,X0) = X0,
inference(forward_demodulation,[status(thm)],[f18,f328]) ).
fof(f344,plain,
! [X0] : or(X0,falsehood) = X0,
inference(paramodulation,[status(thm)],[f24,f329]) ).
fof(f469,plain,
! [X0] : implies(X0,implies(X0,X0)) = truth,
inference(paramodulation,[status(thm)],[f18,f110]) ).
fof(f470,plain,
! [X0] : implies(X0,truth) = truth,
inference(forward_demodulation,[status(thm)],[f109,f469]) ).
fof(f492,plain,
! [X0] : or(X0,truth) = truth,
inference(paramodulation,[status(thm)],[f22,f470]) ).
fof(f493,plain,
! [X0] : implies(falsehood,X0) = truth,
inference(forward_demodulation,[status(thm)],[f98,f492]) ).
fof(f534,plain,
! [X0] : implies(implies(X0,falsehood),falsehood) = implies(truth,X0),
inference(paramodulation,[status(thm)],[f493,f20]) ).
fof(f535,plain,
! [X0] : implies(implies(X0,falsehood),falsehood) = X0,
inference(forward_demodulation,[status(thm)],[f18,f534]) ).
fof(f697,plain,
! [X0] : implies(or(X0,falsehood),falsehood) = not(X0),
inference(paramodulation,[status(thm)],[f22,f535]) ).
fof(f698,plain,
! [X0] : implies(X0,falsehood) = not(X0),
inference(forward_demodulation,[status(thm)],[f344,f697]) ).
fof(f723,plain,
! [X0] : not(implies(X0,falsehood)) = X0,
inference(backward_demodulation,[status(thm)],[f698,f535]) ).
fof(f724,plain,
! [X0] : not(not(X0)) = X0,
inference(forward_demodulation,[status(thm)],[f698,f723]) ).
fof(f797,plain,
! [X0,X1] : or(not(X0),X1) = implies(X0,X1),
inference(paramodulation,[status(thm)],[f724,f22]) ).
fof(f837,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(backward_demodulation,[status(thm)],[f797,f25]) ).
fof(f899,plain,
! [X0] : and(falsehood,X0) = not(truth),
inference(paramodulation,[status(thm)],[f493,f837]) ).
fof(f900,plain,
! [X0] : and(falsehood,X0) = falsehood,
inference(forward_demodulation,[status(thm)],[f33,f899]) ).
fof(f919,plain,
! [X0] : and(X0,truth) = not(implies(X0,falsehood)),
inference(paramodulation,[status(thm)],[f33,f837]) ).
fof(f920,plain,
! [X0] : and(X0,truth) = not(not(X0)),
inference(forward_demodulation,[status(thm)],[f698,f919]) ).
fof(f921,plain,
! [X0] : and(X0,truth) = X0,
inference(forward_demodulation,[status(thm)],[f724,f920]) ).
fof(f1074,plain,
! [X0] : xor(X0,falsehood) = or(and(X0,not(falsehood)),falsehood),
inference(paramodulation,[status(thm)],[f900,f75]) ).
fof(f1075,plain,
! [X0] : xor(X0,falsehood) = and(X0,not(falsehood)),
inference(forward_demodulation,[status(thm)],[f344,f1074]) ).
fof(f1076,plain,
! [X0] : xor(X0,falsehood) = and(X0,truth),
inference(forward_demodulation,[status(thm)],[f302,f1075]) ).
fof(f1077,plain,
! [X0] : xor(X0,falsehood) = X0,
inference(forward_demodulation,[status(thm)],[f921,f1076]) ).
fof(f1090,plain,
x != x,
inference(backward_demodulation,[status(thm)],[f1077,f34]) ).
fof(f1091,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f1090]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL154-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 20:15:19 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.20/0.40 % Refutation found
% 0.20/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.43 % Elapsed time: 0.071401 seconds
% 0.20/0.43 % CPU time: 0.408483 seconds
% 0.20/0.43 % Total memory used: 18.085 MB
% 0.20/0.43 % Net memory used: 17.771 MB
%------------------------------------------------------------------------------