TSTP Solution File: LCL129-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL129-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n019.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:26 EDT 2024
% Result : Unsatisfiable 102.44s 13.24s
% Output : CNFRefutation 103.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 63 ( 35 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 95 ( 95 !; 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,U] : is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,Z)),equivalent(Y,U)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
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,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3)))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,equivalent(X3,X2)))
| is_a_theorem(equivalent(X1,X3)) ),
inference(resolution,[status(thm)],[f8,f5]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X4))))
| is_a_theorem(equivalent(X3,equivalent(X0,equivalent(X4,X2)))) ),
inference(resolution,[status(thm)],[f9,f6]) ).
fof(f12,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(X1,X2)))),
inference(resolution,[status(thm)],[f10,f6]) ).
fof(f13,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(X1,X1)))),
inference(resolution,[status(thm)],[f12,f10]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X2))))
| is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[f13,f9]) ).
fof(f17,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X0,equivalent(X1,X1))) ),
inference(resolution,[status(thm)],[f13,f5]) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X0,equivalent(X3,X2)))) ),
inference(resolution,[status(thm)],[f17,f10]) ).
fof(f32,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[f16,f13]) ).
fof(f33,plain,
! [X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X0),X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[f16,f17]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[status(thm)],[f32,f9]) ).
fof(f37,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X3),equivalent(X2,X3)))) ),
inference(resolution,[status(thm)],[f33,f10]) ).
fof(f39,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(equivalent(X2,X2),equivalent(X3,X1)))
| is_a_theorem(equivalent(X3,X0)) ),
inference(resolution,[status(thm)],[f33,f9]) ).
fof(f48,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0)),
inference(resolution,[status(thm)],[f36,f6]) ).
fof(f50,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[f36,f17]) ).
fof(f52,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[f48,f10]) ).
fof(f56,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X1)))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f48,f5]) ).
fof(f69,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
inference(resolution,[status(thm)],[f56,f48]) ).
fof(f76,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
inference(resolution,[status(thm)],[f69,f10]) ).
fof(f101,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X3))))
| is_a_theorem(equivalent(X1,equivalent(X0,equivalent(X3,X2)))) ),
inference(resolution,[status(thm)],[f52,f9]) ).
fof(f124,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(X0,X2))),
inference(resolution,[status(thm)],[f76,f50]) ).
fof(f203,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(X0,equivalent(X3,X2))) ),
inference(resolution,[status(thm)],[f18,f5]) ).
fof(f242,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X2),X1)))),
inference(resolution,[status(thm)],[f124,f16]) ).
fof(f586,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X2)),X2),X0)),
inference(resolution,[status(thm)],[f242,f36]) ).
fof(f1231,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X2,X3)),X0)) ),
inference(resolution,[status(thm)],[f39,f6]) ).
fof(f2285,plain,
! [X0] :
( ~ is_a_theorem(equivalent(a,equivalent(X0,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X0,a)) ),
inference(resolution,[status(thm)],[f203,f7]) ).
fof(f3523,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(b,e),equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(a,equivalent(X0,equivalent(b,c)))) ),
inference(resolution,[status(thm)],[f2285,f37]) ).
fof(f31494,plain,
! [X0] :
( ~ is_a_theorem(equivalent(a,equivalent(X0,equivalent(b,e))))
| ~ is_a_theorem(equivalent(a,equivalent(equivalent(X0,equivalent(c,e)),equivalent(b,c)))) ),
inference(resolution,[status(thm)],[f1231,f3523]) ).
fof(f34561,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(c,e)),equivalent(a,equivalent(c,b))))
| ~ is_a_theorem(equivalent(a,equivalent(X0,equivalent(b,e)))) ),
inference(resolution,[status(thm)],[f101,f31494]) ).
fof(f34562,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(c,e)),equivalent(a,equivalent(c,b)))),
inference(forward_subsumption_resolution,[status(thm)],[f34561,f10]) ).
fof(f34695,plain,
$false,
inference(resolution,[status(thm)],[f34562,f586]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL129-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.28 % Computer : n019.cluster.edu
% 0.06/0.28 % Model : x86_64 x86_64
% 0.06/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.28 % Memory : 8042.1875MB
% 0.06/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.28 % CPULimit : 300
% 0.06/0.28 % WCLimit : 300
% 0.06/0.28 % DateTime : Mon Apr 29 20:14:29 EDT 2024
% 0.06/0.28 % CPUTime :
% 0.06/0.29 % Drodi V3.6.0
% 102.44/13.24 % Refutation found
% 102.44/13.24 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 102.44/13.24 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 104.21/13.44 % Elapsed time: 13.135759 seconds
% 104.21/13.44 % CPU time: 104.186106 seconds
% 104.21/13.44 % Total memory used: 915.974 MB
% 104.21/13.44 % Net memory used: 841.640 MB
%------------------------------------------------------------------------------