TSTP Solution File: LCL022-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL022-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:02 EDT 2023
% Result : Unsatisfiable 0.17s 0.41s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 17 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 36 (; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(X,Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
file('/export/starexec/sandbox2/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,X1),equivalent(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
| is_a_theorem(equivalent(equivalent(X3,X2),X0)) ),
inference(resolution,[status(thm)],[f9,f5]) ).
fof(f14,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(b,c),equivalent(equivalent(X0,equivalent(c,a)),equivalent(equivalent(a,b),X0)))),
inference(resolution,[status(thm)],[f11,f7]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
| is_a_theorem(equivalent(equivalent(X4,X0),equivalent(equivalent(X3,X2),X4))) ),
inference(resolution,[status(thm)],[f11,f8]) ).
fof(f31,plain,
! [X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(c,a)),equivalent(equivalent(a,b),X0)),equivalent(equivalent(X1,c),equivalent(b,X1)))),
inference(resolution,[status(thm)],[f14,f11]) ).
fof(f89,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),b),equivalent(equivalent(X0,c),equivalent(equivalent(c,a),X0)))),
inference(resolution,[status(thm)],[f31,f15]) ).
fof(f104,plain,
! [X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,c),equivalent(equivalent(c,a),X0)),equivalent(equivalent(X1,b),equivalent(equivalent(a,b),X1)))),
inference(resolution,[status(thm)],[f89,f11]) ).
fof(f241,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(c,a),equivalent(a,b)),equivalent(equivalent(X0,b),equivalent(c,X0)))),
inference(resolution,[status(thm)],[f104,f15]) ).
fof(f258,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(X0,b),equivalent(a,X0)))),
inference(resolution,[status(thm)],[f241,f15]) ).
fof(f259,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f258,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL022-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue May 30 09:41:52 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.5.1
% 0.17/0.41 % Refutation found
% 0.17/0.41 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.43 % Elapsed time: 0.099034 seconds
% 0.17/0.43 % CPU time: 0.350170 seconds
% 0.17/0.43 % Memory used: 26.048 MB
%------------------------------------------------------------------------------