TSTP Solution File: LCL011-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL011-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:01 EDT 2023
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 22 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 (; 45 !; 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] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Y,Z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,plain,
! [Y] :
( ! [X] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X) )
| is_a_theorem(Y) ),
inference(miniscoping,[status(esa)],[f1]) ).
fof(f5,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f6,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X1,X2)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(equivalent(X3,X1),equivalent(X2,X3)),X0))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(equivalent(X3,X1),equivalent(X2,X3)),X0)) ),
inference(resolution,[status(thm)],[f9,f5]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X2,X3)))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f11,f5]) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3)))))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f15,f9]) ).
fof(f26,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X1)))),
inference(resolution,[status(thm)],[f18,f6]) ).
fof(f27,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[f26,f18]) ).
fof(f33,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(resolution,[status(thm)],[f27,f8]) ).
fof(f331,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X0))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[f8,f5]) ).
fof(f398,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X3,X0)) ),
inference(resolution,[status(thm)],[f331,f8]) ).
fof(f700,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(a,c)),equivalent(a,b)))
| ~ is_a_theorem(equivalent(equivalent(c,b),X0)) ),
inference(resolution,[status(thm)],[f398,f7]) ).
fof(f718,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(c,X0)))
| ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(X0,a))) ),
inference(resolution,[status(thm)],[f700,f11]) ).
fof(f818,plain,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))),
inference(resolution,[status(thm)],[f718,f27]) ).
fof(f819,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f818,f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL011-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n005.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 09:41:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.20/0.49 % Refutation found
% 0.20/0.49 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.49 % Elapsed time: 0.144354 seconds
% 0.20/0.49 % CPU time: 1.042509 seconds
% 0.20/0.49 % Memory used: 43.884 MB
%------------------------------------------------------------------------------