TSTP Solution File: LCL006-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : n007.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:08 EDT 2024
% Result : Unsatisfiable 3.43s 0.77s
% Output : CNFRefutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 30 ~; 21 |; 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 : 54 ( 54 !; 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] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,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] : 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(f11,plain,
~ is_a_theorem(equivalent(equivalent(b,c),equivalent(equivalent(a,b),equivalent(c,a)))),
inference(resolution,[status(thm)],[f10,f9]) ).
fof(f12,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f10,f6]) ).
fof(f14,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(f15,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,f8]) ).
fof(f18,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X0,equivalent(X1,X2))))),
inference(resolution,[status(thm)],[f14,f8]) ).
fof(f19,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
inference(resolution,[status(thm)],[f14,f7]) ).
fof(f20,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X2,equivalent(X0,X1))) ),
inference(resolution,[status(thm)],[f14,f10]) ).
fof(f23,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(X1,X0))) ),
inference(resolution,[status(thm)],[f19,f6]) ).
fof(f29,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[f23,f6]) ).
fof(f46,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)],[f29,f14]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X0))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[f18,f12]) ).
fof(f65,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,X1),X2)))),
inference(resolution,[status(thm)],[f20,f8]) ).
fof(f167,plain,
~ is_a_theorem(equivalent(b,equivalent(c,equivalent(equivalent(a,b),equivalent(c,a))))),
inference(resolution,[status(thm)],[f15,f11]) ).
fof(f221,plain,
~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(a,b),equivalent(c,a))),b)),
inference(resolution,[status(thm)],[f10,f167]) ).
fof(f501,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)],[f46,f63]) ).
fof(f575,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X0),X1),X2))),
inference(resolution,[status(thm)],[f65,f20]) ).
fof(f596,plain,
~ is_a_theorem(equivalent(c,equivalent(equivalent(equivalent(a,b),equivalent(c,a)),b))),
inference(resolution,[status(thm)],[f15,f221]) ).
fof(f1316,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),b),X0))
| ~ is_a_theorem(equivalent(X0,c)) ),
inference(resolution,[status(thm)],[f501,f596]) ).
fof(f2220,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(c,a),b)),c)),
inference(resolution,[status(thm)],[f1316,f8]) ).
fof(f3112,plain,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(equivalent(c,a),b),c))),
inference(resolution,[status(thm)],[f2220,f15]) ).
fof(f3113,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f3112,f575]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n007.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Apr 29 20:17:02 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % Drodi V3.6.0
% 3.43/0.77 % Refutation found
% 3.43/0.77 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 3.43/0.77 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.43/0.80 % Elapsed time: 0.487744 seconds
% 3.43/0.80 % CPU time: 3.757951 seconds
% 3.43/0.80 % Total memory used: 110.445 MB
% 3.43/0.80 % Net memory used: 99.828 MB
%------------------------------------------------------------------------------