TSTP Solution File: ALG201+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG201+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.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:19:18 EDT 2024
% Result : Theorem 0.73s 0.90s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 118 ( 38 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 140 ( 46 ~; 33 |; 31 &)
% ( 0 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 57 ( 55 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(subsumption_resolution,[],[f61,f23]) ).
fof(f23,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( sK0 = op2(sK0,sK0)
& sorti2(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f15]) ).
fof(f15,plain,
( ? [X0] :
( op2(X0,X0) = X0
& sorti2(X0) )
=> ( sK0 = op2(sK0,sK0)
& sorti2(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0] :
( op2(X0,X0) = X0
& sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> op2(X0,X0) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f61,plain,
~ sorti2(sK0),
inference(resolution,[],[f60,f18]) ).
fof(f18,plain,
! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) )
& ! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) )
& ! [X2] :
( ! [X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3) )
| ~ sorti2(X2) )
& ! [X4] :
( ! [X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5) )
| ~ sorti1(X4) )
& ! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) )
& ! [X7] :
( sorti2(h(X7))
| ~ sorti1(X7) ) ),
inference(rectify,[],[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(flattening,[],[f8]) ).
fof(f8,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/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f60,plain,
~ sorti1(j(sK0)),
inference(trivial_inequality_removal,[],[f55]) ).
fof(f55,plain,
( j(sK0) != j(sK0)
| ~ sorti1(j(sK0)) ),
inference(superposition,[],[f25,f52]) ).
fof(f52,plain,
j(sK0) = op1(j(sK0),j(sK0)),
inference(subsumption_resolution,[],[f51,f23]) ).
fof(f51,plain,
( j(sK0) = op1(j(sK0),j(sK0))
| ~ sorti2(sK0) ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f48,plain,
( j(sK0) = op1(j(sK0),j(sK0))
| ~ sorti2(sK0)
| ~ sorti2(sK0) ),
inference(superposition,[],[f20,f24]) ).
fof(f24,plain,
sK0 = op2(sK0,sK0),
inference(cnf_transformation,[],[f16]) ).
fof(f20,plain,
! [X2,X3] :
( j(op2(X2,X3)) = op1(j(X2),j(X3))
| ~ sorti2(X3)
| ~ sorti2(X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X0] :
( op1(X0,X0) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0] :
( op1(X0,X0) != X0
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( sorti1(X0)
=> op1(X0,X0) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : ALG201+1 : TPTP v8.2.0. Released v2.7.0.
% 0.09/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.40 % Computer : n020.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8042.1875MB
% 0.15/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Sat May 18 23:05:38 EDT 2024
% 0.15/0.40 % CPUTime :
% 0.15/0.40 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.40 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.90 % (6281)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.73/0.90 % (6282)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.73/0.90 % (6279)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 (2995ds/34Mi)
% 0.73/0.90 % (6280)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 (2995ds/51Mi)
% 0.73/0.90 % (6283)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 (2995ds/34Mi)
% 0.73/0.90 % (6284)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.73/0.90 % (6285)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 (2995ds/83Mi)
% 0.73/0.90 % (6286)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.73/0.90 % (6279)Refutation not found, incomplete strategy% (6279)------------------------------
% 0.73/0.90 % (6279)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (6279)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (6279)Memory used [KB]: 969
% 0.73/0.90 % (6279)Time elapsed: 0.003 s
% 0.73/0.90 % (6279)Instructions burned: 2 (million)
% 0.73/0.90 % (6286)Refutation not found, incomplete strategy% (6286)------------------------------
% 0.73/0.90 % (6286)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (6286)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (6286)Memory used [KB]: 967
% 0.73/0.90 % (6286)Time elapsed: 0.002 s
% 0.73/0.90 % (6286)Instructions burned: 2 (million)
% 0.73/0.90 % (6279)------------------------------
% 0.73/0.90 % (6279)------------------------------
% 0.73/0.90 % (6286)------------------------------
% 0.73/0.90 % (6286)------------------------------
% 0.73/0.90 % (6284)First to succeed.
% 0.73/0.90 % (6282)Also succeeded, but the first one will report.
% 0.73/0.90 % (6284)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6278"
% 0.73/0.90 % (6281)Also succeeded, but the first one will report.
% 0.73/0.90 % (6284)Refutation found. Thanks to Tanya!
% 0.73/0.90 % SZS status Theorem for theBenchmark
% 0.73/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90 % (6284)------------------------------
% 0.73/0.90 % (6284)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (6284)Termination reason: Refutation
% 0.73/0.90
% 0.73/0.90 % (6284)Memory used [KB]: 986
% 0.73/0.90 % (6284)Time elapsed: 0.004 s
% 0.73/0.90 % (6284)Instructions burned: 5 (million)
% 0.73/0.90 % (6278)Success in time 0.495 s
% 0.73/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------