TSTP Solution File: ALG201+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:10:53 EDT 2024
% Result : Theorem 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 68 ( 24 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 72 ( 23 ~; 14 |; 15 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [U] :
( sorti1(U)
=> op1(U,U) != U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
~ ! [U] :
( sorti2(U)
=> op2(U,U) != U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
( ( ! [U] :
( sorti1(U)
=> sorti2(h(U)) )
& ! [V] :
( sorti2(V)
=> sorti1(j(V)) ) )
=> ~ ( ! [W] :
( sorti1(W)
=> ! [X] :
( sorti1(X)
=> h(op1(W,X)) = op2(h(W),h(X)) ) )
& ! [Y] :
( sorti2(Y)
=> ! [Z] :
( sorti2(Z)
=> j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
& ! [X1] :
( sorti2(X1)
=> h(j(X1)) = X1 )
& ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ( ( ! [U] :
( sorti1(U)
=> sorti2(h(U)) )
& ! [V] :
( sorti2(V)
=> sorti1(j(V)) ) )
=> ~ ( ! [W] :
( sorti1(W)
=> ! [X] :
( sorti1(X)
=> h(op1(W,X)) = op2(h(W),h(X)) ) )
& ! [Y] :
( sorti2(Y)
=> ! [Z] :
( sorti2(Z)
=> j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
& ! [X1] :
( sorti2(X1)
=> h(j(X1)) = X1 )
& ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f11,plain,
! [U] :
( ~ sorti1(U)
| op1(U,U) != U ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f12,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,X0) != X0 ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f13,plain,
? [U] :
( sorti2(U)
& op2(U,U) = U ),
inference(pre_NNF_transformation,[status(esa)],[f4]) ).
fof(f14,plain,
( sorti2(sk0_0)
& op2(sk0_0,sk0_0) = sk0_0 ),
inference(skolemization,[status(esa)],[f13]) ).
fof(f15,plain,
sorti2(sk0_0),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f16,plain,
op2(sk0_0,sk0_0) = sk0_0,
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f17,plain,
( ! [U] :
( ~ sorti1(U)
| sorti2(h(U)) )
& ! [V] :
( ~ sorti2(V)
| sorti1(j(V)) )
& ! [W] :
( ~ sorti1(W)
| ! [X] :
( ~ sorti1(X)
| h(op1(W,X)) = op2(h(W),h(X)) ) )
& ! [Y] :
( ~ sorti2(Y)
| ! [Z] :
( ~ sorti2(Z)
| j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
& ! [X1] :
( ~ sorti2(X1)
| h(j(X1)) = X1 )
& ! [X2] :
( ~ sorti1(X2)
| j(h(X2)) = X2 ) ),
inference(pre_NNF_transformation,[status(esa)],[f6]) ).
fof(f19,plain,
! [X0] :
( ~ sorti2(X0)
| sorti1(j(X0)) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f21,plain,
! [X0,X1] :
( ~ sorti2(X0)
| ~ sorti2(X1)
| j(op2(X0,X1)) = op1(j(X0),j(X1)) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f25,plain,
! [X0] :
( ~ sorti2(X0)
| j(op2(sk0_0,X0)) = op1(j(sk0_0),j(X0)) ),
inference(resolution,[status(thm)],[f15,f21]) ).
fof(f27,plain,
sorti1(j(sk0_0)),
inference(resolution,[status(thm)],[f15,f19]) ).
fof(f29,plain,
op1(j(sk0_0),j(sk0_0)) != j(sk0_0),
inference(resolution,[status(thm)],[f27,f12]) ).
fof(f37,plain,
j(op2(sk0_0,sk0_0)) = op1(j(sk0_0),j(sk0_0)),
inference(resolution,[status(thm)],[f25,f15]) ).
fof(f38,plain,
j(sk0_0) = op1(j(sk0_0),j(sk0_0)),
inference(forward_demodulation,[status(thm)],[f16,f37]) ).
fof(f45,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f38,f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 23:30:36 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.6.0
% 0.12/0.35 % Refutation found
% 0.12/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.36 % Elapsed time: 0.018376 seconds
% 0.12/0.36 % CPU time: 0.028930 seconds
% 0.12/0.36 % Total memory used: 8.282 MB
% 0.12/0.36 % Net memory used: 8.121 MB
%------------------------------------------------------------------------------