TSTP Solution File: LCL112-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL112-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n022.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:24 EDT 2024
% Result : Unsatisfiable 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 23 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 70 ( 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(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(implies(X,implies(Y,X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] : is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,plain,
! [Y] :
( ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| is_a_theorem(Y) ),
inference(miniscoping,[status(esa)],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f9,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f10,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f11,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f12,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f13,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f14,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[status(thm)],[f8,f9]) ).
fof(f15,plain,
! [X0,X1,X2] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[status(thm)],[f14,f9]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f33,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[status(thm)],[f12,f8]) ).
fof(f35,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X1))
| is_a_theorem(implies(implies(X1,X0),X0)) ),
inference(resolution,[status(thm)],[f11,f8]) ).
fof(f38,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(not(X1),not(X0)),X2))),
inference(resolution,[status(thm)],[f25,f12]) ).
fof(f42,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[status(thm)],[f25,f9]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[status(thm)],[f42,f8]) ).
fof(f46,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(X0,X1),X1))),
inference(resolution,[status(thm)],[f44,f11]) ).
fof(f48,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[status(thm)],[f44,f12]) ).
fof(f53,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
inference(resolution,[status(thm)],[f48,f25]) ).
fof(f58,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[status(thm)],[f46,f8]) ).
fof(f61,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,implies(X1,X0)),X2),X2)),
inference(resolution,[status(thm)],[f35,f15]) ).
fof(f132,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f61,f44]) ).
fof(f142,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),X1)),
inference(resolution,[status(thm)],[f132,f58]) ).
fof(f1120,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(not(X1),not(X0)),X2)) ),
inference(resolution,[status(thm)],[f38,f8]) ).
fof(f1318,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(not(X0),X2)) ),
inference(resolution,[status(thm)],[f53,f8]) ).
fof(f3717,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(implies(X1,X1))),X0)),
inference(resolution,[status(thm)],[f1120,f142]) ).
fof(f4490,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[status(thm)],[f3717,f1318]) ).
fof(f4508,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(resolution,[status(thm)],[f4490,f33]) ).
fof(f4525,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f13,f4508]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LCL112-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n022.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 : Mon Apr 29 20:10:43 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.33 % Drodi V3.6.0
% 0.16/0.50 % Refutation found
% 0.16/0.50 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.52 % Elapsed time: 0.194261 seconds
% 0.16/0.52 % CPU time: 1.410380 seconds
% 0.16/0.52 % Total memory used: 68.018 MB
% 0.16/0.52 % Net memory used: 64.040 MB
%------------------------------------------------------------------------------