TSTP Solution File: LCL006-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL006-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n020.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:00 EDT 2023
% Result : Unsatisfiable 7.70s 1.41s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 15 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 30 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 53 (; 53 !; 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] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(X,equivalent(Y,Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
file('/export/starexec/sandbox2/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] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f8,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,equivalent(X1,X2)))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f9,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f10,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[f7,f6]) ).
fof(f12,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,X1),X2))),
inference(resolution,[status(thm)],[f8,f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f14,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X0,equivalent(X1,X2))))),
inference(resolution,[status(thm)],[f13,f8]) ).
fof(f15,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
inference(resolution,[status(thm)],[f13,f7]) ).
fof(f18,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(X1,X0))) ),
inference(resolution,[status(thm)],[f15,f6]) ).
fof(f23,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(X1,X0),X1)) ),
inference(resolution,[status(thm)],[f18,f10]) ).
fof(f24,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[f18,f6]) ).
fof(f33,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X1,X0))
| is_a_theorem(X1) ),
inference(resolution,[status(thm)],[f23,f6]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(equivalent(X1,equivalent(X2,X0))) ),
inference(resolution,[status(thm)],[f24,f13]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f12,f6]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X0))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[f33,f14]) ).
fof(f154,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X2,equivalent(X0,X1))) ),
inference(resolution,[status(thm)],[f61,f10]) ).
fof(f216,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),b),c)),
inference(resolution,[status(thm)],[f13,f9]) ).
fof(f252,plain,
~ is_a_theorem(equivalent(c,equivalent(equivalent(equivalent(a,b),equivalent(c,a)),b))),
inference(resolution,[status(thm)],[f10,f216]) ).
fof(f391,plain,
~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(a,b),equivalent(c,a))),b)),
inference(resolution,[status(thm)],[f252,f13]) ).
fof(f629,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[status(thm)],[f77,f42]) ).
fof(f2427,plain,
! [X0] :
( ~ is_a_theorem(equivalent(b,X0))
| ~ is_a_theorem(equivalent(X0,equivalent(c,equivalent(equivalent(a,b),equivalent(c,a))))) ),
inference(resolution,[status(thm)],[f629,f391]) ).
fof(f3614,plain,
~ is_a_theorem(equivalent(b,equivalent(equivalent(c,equivalent(a,b)),equivalent(c,a)))),
inference(resolution,[status(thm)],[f2427,f8]) ).
fof(f4774,plain,
~ is_a_theorem(equivalent(equivalent(c,equivalent(a,b)),equivalent(equivalent(c,a),b))),
inference(resolution,[status(thm)],[f3614,f154]) ).
fof(f4775,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f4774,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33 % Computer : n020.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Tue May 30 09:42:58 EDT 2023
% 0.10/0.33 % CPUTime :
% 0.10/0.33 % Drodi V3.5.1
% 7.70/1.41 % Refutation found
% 7.70/1.41 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 7.70/1.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 8.38/1.45 % Elapsed time: 1.107416 seconds
% 8.38/1.45 % CPU time: 8.369294 seconds
% 8.38/1.45 % Memory used: 126.056 MB
%------------------------------------------------------------------------------