TSTP Solution File: LCL016-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL016-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 : Tue Apr 30 20:26:09 EDT 2024
% Result : Unsatisfiable 9.27s 1.53s
% Output : CNFRefutation 9.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 87 ( 47 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 7 ( 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 : 77 ( 77 !; 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(Z,equivalent(equivalent(Z,Y),X)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))),
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(X2,equivalent(equivalent(X2,X1),X0)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X2,equivalent(equivalent(X2,X1),X0))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X2,X1),X0)) ),
inference(resolution,[status(thm)],[f8,f5]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f9,f5]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(X2) ),
inference(resolution,[status(thm)],[f18,f9]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[f20,f6]) ).
fof(f41,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X2,X1),X0))) ),
inference(resolution,[status(thm)],[f24,f6]) ).
fof(f43,plain,
! [X0,X1,X2] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[status(thm)],[f24,f8]) ).
fof(f48,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X1),X0),X2)),
inference(resolution,[status(thm)],[f41,f6]) ).
fof(f50,plain,
! [X0,X1,X2] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,X2),X0)),X2)) ),
inference(resolution,[status(thm)],[f43,f6]) ).
fof(f60,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X1))
| ~ is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[status(thm)],[f48,f43]) ).
fof(f70,plain,
! [X0,X1,X2] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X1),X0)))
| ~ is_a_theorem(X2) ),
inference(resolution,[status(thm)],[f50,f9]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X1),X2),X0))
| is_a_theorem(X2) ),
inference(resolution,[status(thm)],[f60,f50]) ).
fof(f72,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)],[f60,f43]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X0))
| is_a_theorem(X2) ),
inference(resolution,[status(thm)],[f60,f5]) ).
fof(f97,plain,
! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[f70,f8]) ).
fof(f99,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[status(thm)],[f97,f60]) ).
fof(f103,plain,
! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X1))) ),
inference(resolution,[status(thm)],[f71,f60]) ).
fof(f108,plain,
! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X1)) ),
inference(resolution,[status(thm)],[f103,f8]) ).
fof(f109,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1)),
inference(resolution,[status(thm)],[f108,f48]) ).
fof(f110,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[f108,f60]) ).
fof(f142,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X0,X1),X2)),equivalent(X2,X1))),
inference(resolution,[status(thm)],[f110,f6]) ).
fof(f602,plain,
! [X0] :
( ~ is_a_theorem(equivalent(X0,equivalent(a,b)))
| ~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,c),a)),X0)) ),
inference(resolution,[status(thm)],[f72,f7]) ).
fof(f944,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X0,equivalent(equivalent(b,c),a)),c)),equivalent(a,b))),
inference(resolution,[status(thm)],[f602,f6]) ).
fof(f1082,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(b,c),a)),c))
| ~ is_a_theorem(equivalent(equivalent(a,b),X0)) ),
inference(resolution,[status(thm)],[f99,f944]) ).
fof(f1328,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(equivalent(X2,X1),X0)) ),
inference(resolution,[status(thm)],[f142,f81]) ).
fof(f3072,plain,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(equivalent(b,c),a),c))),
inference(resolution,[status(thm)],[f1082,f109]) ).
fof(f6893,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(b,c),a),c),b),a)),
inference(resolution,[status(thm)],[f1328,f3072]) ).
fof(f6894,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f6893,f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n004.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 : Mon Apr 29 20:26:18 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 9.27/1.53 % Refutation found
% 9.27/1.53 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 9.27/1.53 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 9.27/1.58 % Elapsed time: 1.215248 seconds
% 9.27/1.58 % CPU time: 9.536297 seconds
% 9.27/1.58 % Total memory used: 246.940 MB
% 9.27/1.58 % Net memory used: 238.774 MB
%------------------------------------------------------------------------------