TSTP Solution File: LCL104-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL104-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n002.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:16 EDT 2023
% Result : Unsatisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 67 (; 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z,U] : is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(Z,U)),X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,plain,
! [Y] :
( ! [X] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X) )
| is_a_theorem(Y) ),
inference(miniscoping,[status(esa)],[f1]) ).
fof(f6,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f7,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f8,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f9,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)))
| is_a_theorem(X2) ),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f11,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[f7,f10]) ).
fof(f12,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0)) ),
inference(resolution,[status(thm)],[f7,f6]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X2,X1))) ),
inference(resolution,[status(thm)],[f11,f6]) ).
fof(f25,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3))),equivalent(X0,X3))),
inference(resolution,[status(thm)],[f23,f8]) ).
fof(f26,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(equivalent(X3,X1),equivalent(X3,X2))))),
inference(resolution,[status(thm)],[f23,f11]) ).
fof(f34,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3))))
| is_a_theorem(equivalent(X0,X3)) ),
inference(resolution,[status(thm)],[f25,f6]) ).
fof(f41,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[status(thm)],[f34,f26]) ).
fof(f42,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1))),X3),X3)),
inference(resolution,[status(thm)],[f34,f7]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[f41,f6]) ).
fof(f47,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2)) ),
inference(resolution,[status(thm)],[f46,f12]) ).
fof(f107,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(resolution,[status(thm)],[f47,f42]) ).
fof(f184,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[status(thm)],[f107,f47]) ).
fof(f325,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f9,f184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL104-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 10:00:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % Drodi V3.5.1
% 0.12/0.36 % Refutation found
% 0.12/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37 % Elapsed time: 0.026477 seconds
% 0.12/0.37 % CPU time: 0.074282 seconds
% 0.12/0.37 % Memory used: 9.112 MB
%------------------------------------------------------------------------------