TSTP Solution File: LCL155-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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:30 EDT 2024
% Result : Unsatisfiable 0.14s 0.33s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 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 : 52 ( 52 !; 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(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,x) != falsehood,
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(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,x) != falsehood,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f37,plain,
! [X0,X1] : implies(X0,implies(implies(X0,X1),implies(truth,X1))) = truth,
inference(paramodulation,[status(thm)],[f18,f19]) ).
fof(f38,plain,
! [X0,X1] : implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(forward_demodulation,[status(thm)],[f18,f37]) ).
fof(f76,plain,
! [X0] : implies(implies(truth,X0),X0) = truth,
inference(paramodulation,[status(thm)],[f18,f38]) ).
fof(f77,plain,
! [X0] : implies(X0,X0) = truth,
inference(forward_demodulation,[status(thm)],[f18,f76]) ).
fof(f104,plain,
! [X0] : or(X0,not(X0)) = truth,
inference(paramodulation,[status(thm)],[f22,f77]) ).
fof(f115,plain,
! [X0,X1] : implies(or(X0,not(X1)),implies(X1,X0)) = truth,
inference(forward_demodulation,[status(thm)],[f22,f21]) ).
fof(f119,plain,
! [X0] : implies(or(X0,falsehood),implies(truth,X0)) = truth,
inference(paramodulation,[status(thm)],[f33,f115]) ).
fof(f120,plain,
! [X0] : implies(or(X0,falsehood),X0) = truth,
inference(forward_demodulation,[status(thm)],[f18,f119]) ).
fof(f149,plain,
! [X0] : implies(or(falsehood,X0),X0) = truth,
inference(paramodulation,[status(thm)],[f24,f120]) ).
fof(f184,plain,
implies(truth,not(falsehood)) = truth,
inference(paramodulation,[status(thm)],[f104,f149]) ).
fof(f185,plain,
not(falsehood) = truth,
inference(forward_demodulation,[status(thm)],[f18,f184]) ).
fof(f202,plain,
! [X0] : or(falsehood,X0) = implies(truth,X0),
inference(paramodulation,[status(thm)],[f185,f22]) ).
fof(f203,plain,
! [X0] : or(falsehood,X0) = X0,
inference(forward_demodulation,[status(thm)],[f18,f202]) ).
fof(f227,plain,
! [X0] : and(X0,not(X0)) = not(truth),
inference(paramodulation,[status(thm)],[f104,f25]) ).
fof(f228,plain,
! [X0] : and(X0,not(X0)) = falsehood,
inference(forward_demodulation,[status(thm)],[f33,f227]) ).
fof(f315,plain,
! [X0] : xor(X0,X0) = or(falsehood,and(not(X0),X0)),
inference(paramodulation,[status(thm)],[f228,f28]) ).
fof(f316,plain,
! [X0] : xor(X0,X0) = and(not(X0),X0),
inference(forward_demodulation,[status(thm)],[f203,f315]) ).
fof(f317,plain,
! [X0] : xor(X0,X0) = and(X0,not(X0)),
inference(forward_demodulation,[status(thm)],[f27,f316]) ).
fof(f318,plain,
! [X0] : xor(X0,X0) = falsehood,
inference(forward_demodulation,[status(thm)],[f228,f317]) ).
fof(f345,plain,
falsehood != falsehood,
inference(backward_demodulation,[status(thm)],[f318,f34]) ).
fof(f346,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f345]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : LCL155-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n008.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Apr 29 20:27:12 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % Drodi V3.6.0
% 0.14/0.33 % Refutation found
% 0.14/0.33 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.35 % Elapsed time: 0.037108 seconds
% 0.14/0.35 % CPU time: 0.227862 seconds
% 0.14/0.35 % Total memory used: 16.423 MB
% 0.14/0.35 % Net memory used: 16.272 MB
%------------------------------------------------------------------------------