TSTP Solution File: ALG070+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG070+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 : n015.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:17:50 EDT 2024
% Result : Theorem 0.66s 0.83s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 22 unt; 0 def)
% Number of atoms : 173 ( 68 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 187 ( 60 ~; 46 |; 46 &)
% ( 0 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 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 : 78 ( 70 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f124,plain,
$false,
inference(subsumption_resolution,[],[f123,f29]) ).
fof(f29,plain,
sK0 != op2(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( sK0 != op2(sK0,sK1)
& op2(sK0,sK0) = sK1
& sorti2(sK1)
& sorti2(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f18,f17]) ).
fof(f17,plain,
( ? [X0] :
( ? [X1] :
( op2(X0,X1) != X0
& op2(X0,X0) = X1
& sorti2(X1) )
& sorti2(X0) )
=> ( ? [X1] :
( sK0 != op2(sK0,X1)
& op2(sK0,sK0) = X1
& sorti2(X1) )
& sorti2(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ? [X1] :
( sK0 != op2(sK0,X1)
& op2(sK0,sK0) = X1
& sorti2(X1) )
=> ( sK0 != op2(sK0,sK1)
& op2(sK0,sK0) = sK1
& sorti2(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( ? [X1] :
( op2(X0,X1) != X0
& op2(X0,X0) = X1
& sorti2(X1) )
& sorti2(X0) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
? [X0] :
( ? [X1] :
( op2(X0,X1) != X0
& op2(X0,X0) = X1
& sorti2(X1) )
& sorti2(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
~ ! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> ( op2(X0,X1) = X0
| op2(X0,X0) != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f123,plain,
sK0 = op2(sK0,sK1),
inference(forward_demodulation,[],[f121,f39]) ).
fof(f39,plain,
sK0 = h(j(sK0)),
inference(unit_resulting_resolution,[],[f26,f24]) ).
fof(f24,plain,
! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,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/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f26,plain,
sorti2(sK0),
inference(cnf_transformation,[],[f19]) ).
fof(f121,plain,
op2(sK0,sK1) = h(j(sK0)),
inference(backward_demodulation,[],[f101,f119]) ).
fof(f119,plain,
j(sK0) = op1(j(sK0),j(sK1)),
inference(backward_demodulation,[],[f73,f107]) ).
fof(f107,plain,
j(sK1) = op1(j(sK0),j(sK0)),
inference(backward_demodulation,[],[f58,f106]) ).
fof(f106,plain,
sK1 = h(op1(j(sK0),j(sK0))),
inference(forward_demodulation,[],[f105,f28]) ).
fof(f28,plain,
op2(sK0,sK0) = sK1,
inference(cnf_transformation,[],[f19]) ).
fof(f105,plain,
op2(sK0,sK0) = h(op1(j(sK0),j(sK0))),
inference(forward_demodulation,[],[f85,f39]) ).
fof(f85,plain,
h(op1(j(sK0),j(sK0))) = op2(h(j(sK0)),h(j(sK0))),
inference(unit_resulting_resolution,[],[f34,f34,f22]) ).
fof(f22,plain,
! [X4,X5] :
( h(op1(X4,X5)) = op2(h(X4),h(X5))
| ~ sorti1(X5)
| ~ sorti1(X4) ),
inference(cnf_transformation,[],[f16]) ).
fof(f34,plain,
sorti1(j(sK0)),
inference(unit_resulting_resolution,[],[f26,f21]) ).
fof(f21,plain,
! [X6] :
( sorti1(j(X6))
| ~ sorti2(X6) ),
inference(cnf_transformation,[],[f16]) ).
fof(f58,plain,
op1(j(sK0),j(sK0)) = j(h(op1(j(sK0),j(sK0)))),
inference(unit_resulting_resolution,[],[f48,f25]) ).
fof(f25,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f48,plain,
sorti1(op1(j(sK0),j(sK0))),
inference(unit_resulting_resolution,[],[f34,f34,f31]) ).
fof(f31,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(f73,plain,
j(sK0) = op1(j(sK0),op1(j(sK0),j(sK0))),
inference(unit_resulting_resolution,[],[f34,f48,f33]) ).
fof(f33,plain,
! [X0] :
( op1(X0,op1(X0,X0)) = X0
| ~ sorti1(op1(X0,X0))
| ~ sorti1(X0) ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( op1(X0,X1) = X0
| op1(X0,X0) != X1
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ! [X1] :
( op1(X0,X1) = X0
| op1(X0,X0) != X1
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X0] :
( ! [X1] :
( op1(X0,X1) = X0
| op1(X0,X0) != X1
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> ( op1(X0,X1) = X0
| op1(X0,X0) != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f101,plain,
op2(sK0,sK1) = h(op1(j(sK0),j(sK1))),
inference(forward_demodulation,[],[f100,f39]) ).
fof(f100,plain,
h(op1(j(sK0),j(sK1))) = op2(h(j(sK0)),sK1),
inference(forward_demodulation,[],[f88,f40]) ).
fof(f40,plain,
sK1 = h(j(sK1)),
inference(unit_resulting_resolution,[],[f27,f24]) ).
fof(f27,plain,
sorti2(sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f88,plain,
h(op1(j(sK0),j(sK1))) = op2(h(j(sK0)),h(j(sK1))),
inference(unit_resulting_resolution,[],[f34,f35,f22]) ).
fof(f35,plain,
sorti1(j(sK1)),
inference(unit_resulting_resolution,[],[f27,f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG070+1 : TPTP v8.2.0. Released v2.7.0.
% 0.03/0.13 % 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.12/0.34 % Computer : n015.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 : Sat May 18 22:36:52 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 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.61/0.82 % (16114)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.61/0.82 % (16113)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.61/0.82 % (16110)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.61/0.82 % (16111)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.61/0.82 % (16112)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.82 % (16115)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.61/0.82 % (16117)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.66/0.82 % (16116)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.66/0.82 % (16117)Refutation not found, incomplete strategy% (16117)------------------------------
% 0.66/0.82 % (16117)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.66/0.82 % (16117)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.82
% 0.66/0.82 % (16117)Memory used [KB]: 970
% 0.66/0.82 % (16117)Time elapsed: 0.003 s
% 0.66/0.82 % (16110)Refutation not found, incomplete strategy% (16110)------------------------------
% 0.66/0.82 % (16110)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.66/0.82 % (16117)Instructions burned: 2 (million)
% 0.66/0.82 % (16110)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.82
% 0.66/0.82 % (16110)Memory used [KB]: 970
% 0.66/0.82 % (16110)Time elapsed: 0.004 s
% 0.66/0.82 % (16110)Instructions burned: 3 (million)
% 0.66/0.82 % (16117)------------------------------
% 0.66/0.82 % (16117)------------------------------
% 0.66/0.82 % (16110)------------------------------
% 0.66/0.82 % (16110)------------------------------
% 0.66/0.82 % (16113)First to succeed.
% 0.66/0.83 % (16113)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16109"
% 0.66/0.83 % (16113)Refutation found. Thanks to Tanya!
% 0.66/0.83 % SZS status Theorem for theBenchmark
% 0.66/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.66/0.83 % (16113)------------------------------
% 0.66/0.83 % (16113)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.66/0.83 % (16113)Termination reason: Refutation
% 0.66/0.83
% 0.66/0.83 % (16113)Memory used [KB]: 1065
% 0.66/0.83 % (16113)Time elapsed: 0.006 s
% 0.66/0.83 % (16113)Instructions burned: 8 (million)
% 0.66/0.83 % (16109)Success in time 0.484 s
% 0.66/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------