TSTP Solution File: ALG019+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG019+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.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 : Mon May 20 18:16:55 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 111 ( 35 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 120 ( 37 ~; 26 |; 27 &)
% ( 0 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 58 ( 53 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f382,plain,
$false,
inference(subsumption_resolution,[],[f381,f32]) ).
fof(f32,plain,
j(sK0) != op1(sK1(j(sK0)),sK1(j(sK0))),
inference(unit_resulting_resolution,[],[f27,f24]) ).
fof(f24,plain,
! [X0] :
( ~ sorti1(X0)
| op1(sK1(X0),sK1(X0)) != X0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0] :
( ? [X1] :
( op1(X1,X1) != X0
& sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
~ ? [X0] :
( ! [X1] :
( sorti1(X1)
=> op1(X1,X1) = X0 )
& sorti1(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f27,plain,
sorti1(j(sK0)),
inference(unit_resulting_resolution,[],[f22,f19]) ).
fof(f19,plain,
! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X3] :
( h(j(X3)) = X3
| ~ sorti2(X3) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( ! [X7] :
( h(op1(X6,X7)) = op2(h(X6),h(X7))
| ~ sorti1(X7) )
| ~ sorti1(X6) )
& ! [X0] :
( sorti1(j(X0))
| ~ sorti2(X0) )
& ! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ( ( ! [X0] :
( sorti2(X0)
=> sorti1(j(X0)) )
& ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X3] :
( sorti2(X3)
=> h(j(X3)) = X3 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti1(X6)
=> ! [X7] :
( sorti1(X7)
=> h(op1(X6,X7)) = op2(h(X6),h(X7)) ) ) ) ),
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 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
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 )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f22,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( op2(X1,X1) = X0
| ~ sorti2(X1) )
& sorti2(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0] :
( ! [X1] :
( sorti2(X1)
=> op2(X1,X1) = X0 )
& sorti2(X0) ),
inference(flattening,[],[f4]) ).
fof(f4,axiom,
~ ~ ? [X0] :
( ! [X1] :
( sorti2(X1)
=> op2(X1,X1) = X0 )
& sorti2(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f381,plain,
j(sK0) = op1(sK1(j(sK0)),sK1(j(sK0))),
inference(forward_demodulation,[],[f380,f70]) ).
fof(f70,plain,
sK0 = op2(h(sK1(j(sK0))),h(sK1(j(sK0)))),
inference(unit_resulting_resolution,[],[f42,f21]) ).
fof(f21,plain,
! [X1] :
( ~ sorti2(X1)
| op2(X1,X1) = sK0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f42,plain,
sorti2(h(sK1(j(sK0)))),
inference(unit_resulting_resolution,[],[f31,f20]) ).
fof(f20,plain,
! [X1] :
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
sorti1(sK1(j(sK0))),
inference(unit_resulting_resolution,[],[f27,f23]) ).
fof(f23,plain,
! [X0] :
( sorti1(sK1(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f380,plain,
op1(sK1(j(sK0)),sK1(j(sK0))) = j(op2(h(sK1(j(sK0))),h(sK1(j(sK0))))),
inference(forward_demodulation,[],[f284,f88]) ).
fof(f88,plain,
sK1(j(sK0)) = j(h(sK1(j(sK0)))),
inference(unit_resulting_resolution,[],[f31,f17]) ).
fof(f17,plain,
! [X2] :
( ~ sorti1(X2)
| j(h(X2)) = X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f284,plain,
j(op2(h(sK1(j(sK0))),h(sK1(j(sK0))))) = op1(j(h(sK1(j(sK0)))),j(h(sK1(j(sK0))))),
inference(unit_resulting_resolution,[],[f42,f42,f15]) ).
fof(f15,plain,
! [X4,X5] :
( ~ sorti2(X5)
| ~ sorti2(X4)
| j(op2(X4,X5)) = op1(j(X4),j(X5)) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ALG019+1 : TPTP v8.2.0. Released v2.7.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 23:26:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.73 % (26228)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.55/0.73 % (26222)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (26223)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.55/0.74 % (26224)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74 % (26225)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.74 % (26226)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (26227)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.74 % (26222)Refutation not found, incomplete strategy% (26222)------------------------------
% 0.55/0.74 % (26222)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (26222)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (26222)Memory used [KB]: 971
% 0.55/0.74 % (26222)Time elapsed: 0.003 s
% 0.55/0.74 % (26222)Instructions burned: 3 (million)
% 0.55/0.74 % (26222)------------------------------
% 0.55/0.74 % (26222)------------------------------
% 0.55/0.74 % (26228)First to succeed.
% 0.55/0.74 % (26228)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26221"
% 0.55/0.74 % (26227)Also succeeded, but the first one will report.
% 0.55/0.74 % (26228)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (26228)------------------------------
% 0.55/0.74 % (26228)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (26228)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (26228)Memory used [KB]: 1073
% 0.55/0.74 % (26228)Time elapsed: 0.005 s
% 0.55/0.74 % (26228)Instructions burned: 12 (million)
% 0.55/0.74 % (26221)Success in time 0.37 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------