TSTP Solution File: ALG029+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : ALG029+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n025.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 : Wed Aug 31 15:38:54 EDT 2022
% Result : Theorem 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 136 ( 48 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 147 ( 45 ~; 32 |; 37 &)
% ( 0 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 60 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f87,plain,
$false,
inference(subsumption_resolution,[],[f86,f27]) ).
fof(f27,plain,
op2(sK1,sK0) != op2(sK0,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
( sorti2(sK0)
& op2(sK1,sK0) != op2(sK0,sK1)
& sorti2(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f16,f15]) ).
fof(f15,plain,
( ? [X0] :
( sorti2(X0)
& ? [X1] :
( op2(X0,X1) != op2(X1,X0)
& sorti2(X1) ) )
=> ( sorti2(sK0)
& ? [X1] :
( op2(X1,sK0) != op2(sK0,X1)
& sorti2(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X1] :
( op2(X1,sK0) != op2(sK0,X1)
& sorti2(X1) )
=> ( op2(sK1,sK0) != op2(sK0,sK1)
& sorti2(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0] :
( sorti2(X0)
& ? [X1] :
( op2(X0,X1) != op2(X1,X0)
& sorti2(X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> op2(X0,X1) = op2(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f86,plain,
op2(sK1,sK0) = op2(sK0,sK1),
inference(forward_demodulation,[],[f85,f82]) ).
fof(f82,plain,
h(op1(j(sK0),j(sK1))) = op2(sK0,sK1),
inference(forward_demodulation,[],[f81,f65]) ).
fof(f65,plain,
h(j(sK0)) = sK0,
inference(resolution,[],[f19,f28]) ).
fof(f28,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f17]) ).
fof(f19,plain,
! [X7] :
( ~ sorti2(X7)
| h(j(X7)) = X7 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( ~ sorti2(X1)
| ! [X2] :
( ~ sorti2(X2)
| op1(j(X1),j(X2)) = j(op2(X1,X2)) ) )
& ! [X3] :
( ~ sorti1(X3)
| ! [X4] :
( ~ sorti1(X4)
| h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( j(h(X5)) = X5
| ~ sorti1(X5) )
& ! [X6] :
( ~ sorti2(X6)
| sorti1(j(X6)) )
& ! [X7] :
( ~ sorti2(X7)
| h(j(X7)) = X7 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
( ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X6] :
( ~ sorti2(X6)
| ! [X7] :
( ~ sorti2(X7)
| j(op2(X6,X7)) = op1(j(X6),j(X7)) ) )
& ! [X3] :
( ~ sorti1(X3)
| ! [X4] :
( ~ sorti1(X4)
| h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X1] :
( ~ sorti2(X1)
| sorti1(j(X1)) )
& ! [X5] :
( ~ sorti2(X5)
| h(j(X5)) = X5 ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X6] :
( ~ sorti2(X6)
| ! [X7] :
( ~ sorti2(X7)
| j(op2(X6,X7)) = op1(j(X6),j(X7)) ) )
& ! [X3] :
( ~ sorti1(X3)
| ! [X4] :
( ~ sorti1(X4)
| h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( ~ sorti2(X5)
| h(j(X5)) = X5 )
& ! [X1] :
( ~ sorti2(X1)
| sorti1(j(X1)) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X6] :
( sorti2(X6)
=> ! [X7] :
( sorti2(X7)
=> j(op2(X6,X7)) = op1(j(X6),j(X7)) ) )
& ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> h(j(X5)) = X5 ) ) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) ) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
( ( ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) )
& ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) ) )
=> ~ ( ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f81,plain,
h(op1(j(sK0),j(sK1))) = op2(h(j(sK0)),sK1),
inference(forward_demodulation,[],[f75,f61]) ).
fof(f61,plain,
sK1 = h(j(sK1)),
inference(unit_resulting_resolution,[],[f26,f19]) ).
fof(f26,plain,
sorti2(sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f75,plain,
h(op1(j(sK0),j(sK1))) = op2(h(j(sK0)),h(j(sK1))),
inference(unit_resulting_resolution,[],[f34,f30,f22]) ).
fof(f22,plain,
! [X3,X4] :
( ~ sorti1(X4)
| h(op1(X3,X4)) = op2(h(X3),h(X4))
| ~ sorti1(X3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f30,plain,
sorti1(j(sK1)),
inference(unit_resulting_resolution,[],[f26,f20]) ).
fof(f20,plain,
! [X6] :
( ~ sorti2(X6)
| sorti1(j(X6)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
sorti1(j(sK0)),
inference(resolution,[],[f20,f28]) ).
fof(f85,plain,
h(op1(j(sK0),j(sK1))) = op2(sK1,sK0),
inference(forward_demodulation,[],[f84,f54]) ).
fof(f54,plain,
op1(j(sK0),j(sK1)) = op1(j(sK1),j(sK0)),
inference(unit_resulting_resolution,[],[f30,f34,f29]) ).
fof(f29,plain,
! [X0,X1] :
( op1(X0,X1) = op1(X1,X0)
| ~ sorti1(X0)
| ~ sorti1(X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0] :
( ~ sorti1(X0)
| ! [X1] :
( op1(X0,X1) = op1(X1,X0)
| ~ sorti1(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> op1(X0,X1) = op1(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f84,plain,
h(op1(j(sK1),j(sK0))) = op2(sK1,sK0),
inference(forward_demodulation,[],[f83,f61]) ).
fof(f83,plain,
h(op1(j(sK1),j(sK0))) = op2(h(j(sK1)),sK0),
inference(forward_demodulation,[],[f76,f65]) ).
fof(f76,plain,
h(op1(j(sK1),j(sK0))) = op2(h(j(sK1)),h(j(sK0))),
inference(unit_resulting_resolution,[],[f30,f34,f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG029+1 : TPTP v8.1.0. Released v2.7.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 29 14:59:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49 % (2503)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.49 % (2510)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.18/0.49 % (2502)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.49 % (2495)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.18/0.49 % (2502)Instruction limit reached!
% 0.18/0.49 % (2502)------------------------------
% 0.18/0.49 % (2502)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (2502)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (2502)Termination reason: Unknown
% 0.18/0.49 % (2502)Termination phase: Saturation
% 0.18/0.49
% 0.18/0.49 % (2502)Memory used [KB]: 5884
% 0.18/0.49 % (2502)Time elapsed: 0.054 s
% 0.18/0.49 % (2502)Instructions burned: 3 (million)
% 0.18/0.49 % (2502)------------------------------
% 0.18/0.49 % (2502)------------------------------
% 0.18/0.50 % (2494)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.18/0.50 % (2500)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.18/0.50 % (2511)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.18/0.50 % (2503)Instruction limit reached!
% 0.18/0.50 % (2503)------------------------------
% 0.18/0.50 % (2503)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (2495)First to succeed.
% 0.18/0.51 % (2503)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (2495)Refutation found. Thanks to Tanya!
% 0.18/0.51 % SZS status Theorem for theBenchmark
% 0.18/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51 % (2495)------------------------------
% 0.18/0.51 % (2495)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (2495)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (2495)Termination reason: Refutation
% 0.18/0.51
% 0.18/0.51 % (2495)Memory used [KB]: 6012
% 0.18/0.51 % (2495)Time elapsed: 0.113 s
% 0.18/0.51 % (2495)Instructions burned: 3 (million)
% 0.18/0.51 % (2495)------------------------------
% 0.18/0.51 % (2495)------------------------------
% 0.18/0.51 % (2487)Success in time 0.167 s
%------------------------------------------------------------------------------