TSTP Solution File: GRP711+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GRP711+1 : TPTP v8.2.0. Released v4.0.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 : n027.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 21:12:37 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 23 unt; 0 def)
% Number of atoms : 83 ( 63 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 64 ( 26 ~; 18 |; 11 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 44 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f267,plain,
$false,
inference(avatar_sat_refutation,[],[f31,f181,f259]) ).
fof(f259,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f258]) ).
fof(f258,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f257,f22]) ).
fof(f22,plain,
sK1 != sK2,
inference(duplicate_literal_removal,[],[f16]) ).
fof(f16,plain,
( sK1 != sK2
| sK1 != sK2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( ( sK1 != sK2
& mult(sK1,sK0) = mult(sK2,sK0) )
| ( sK1 != sK2
& mult(sK0,sK2) = mult(sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
fof(f11,plain,
( ? [X0,X1,X2] :
( ( X1 != X2
& mult(X1,X0) = mult(X2,X0) )
| ( X1 != X2
& mult(X0,X2) = mult(X0,X1) ) )
=> ( ( sK1 != sK2
& mult(sK1,sK0) = mult(sK2,sK0) )
| ( sK1 != sK2
& mult(sK0,sK2) = mult(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0,X1,X2] :
( ( X1 != X2
& mult(X1,X0) = mult(X2,X0) )
| ( X1 != X2
& mult(X0,X2) = mult(X0,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2] :
( ( mult(X1,X0) = mult(X2,X0)
=> X1 = X2 )
& ( mult(X0,X2) = mult(X0,X1)
=> X1 = X2 ) ),
inference(rectify,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X3,X4,X5] :
( ( mult(X4,X3) = mult(X5,X3)
=> X4 = X5 )
& ( mult(X3,X4) = mult(X3,X5)
=> X4 = X5 ) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X3,X4,X5] :
( ( mult(X4,X3) = mult(X5,X3)
=> X4 = X5 )
& ( mult(X3,X4) = mult(X3,X5)
=> X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f257,plain,
( sK1 = sK2
| ~ spl3_1 ),
inference(forward_demodulation,[],[f232,f85]) ).
fof(f85,plain,
! [X0,X1] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
inference(forward_demodulation,[],[f72,f20]) ).
fof(f20,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f72,plain,
! [X0,X1] : mult(unit,X1) = mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))),
inference(superposition,[],[f60,f17]) ).
fof(f17,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] : unit = mult(i(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f60,plain,
! [X2,X0,X1] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(X2,mult(X1,X1)),X0),
inference(backward_demodulation,[],[f19,f59]) ).
fof(f59,plain,
! [X0,X1] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(forward_demodulation,[],[f46,f21]) ).
fof(f21,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f46,plain,
! [X0,X1] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,mult(X1,unit))),
inference(superposition,[],[f19,f21]) ).
fof(f19,plain,
! [X2,X0,X1] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X2,X0] : mult(X0,mult(X2,mult(X2,X1))) = mult(mult(mult(X0,X2),X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f232,plain,
( sK2 = mult(i(mult(sK0,sK0)),mult(sK0,mult(sK0,sK1)))
| ~ spl3_1 ),
inference(superposition,[],[f85,f26]) ).
fof(f26,plain,
( mult(sK0,sK2) = mult(sK0,sK1)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl3_1
<=> mult(sK0,sK2) = mult(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f181,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f180]) ).
fof(f180,plain,
( $false
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f176,f22]) ).
fof(f176,plain,
( sK1 = sK2
| ~ spl3_2 ),
inference(superposition,[],[f21,f143]) ).
fof(f143,plain,
( sK1 = mult(sK2,unit)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f125,f21]) ).
fof(f125,plain,
( mult(sK2,unit) = mult(sK1,unit)
| ~ spl3_2 ),
inference(superposition,[],[f56,f94]) ).
fof(f94,plain,
! [X0] : unit = mult(X0,mult(X0,i(mult(X0,X0)))),
inference(superposition,[],[f53,f18]) ).
fof(f18,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] : unit = mult(X0,i(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f53,plain,
! [X0,X1] : mult(X0,mult(X0,X1)) = mult(mult(X0,X0),X1),
inference(forward_demodulation,[],[f40,f20]) ).
fof(f40,plain,
! [X0,X1] : mult(unit,mult(X0,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[],[f19,f20]) ).
fof(f56,plain,
( ! [X0] : mult(sK2,mult(sK0,mult(sK0,X0))) = mult(sK1,mult(sK0,mult(sK0,X0)))
| ~ spl3_2 ),
inference(forward_demodulation,[],[f43,f19]) ).
fof(f43,plain,
( ! [X0] : mult(sK2,mult(sK0,mult(sK0,X0))) = mult(mult(mult(sK1,sK0),sK0),X0)
| ~ spl3_2 ),
inference(superposition,[],[f19,f30]) ).
fof(f30,plain,
( mult(sK1,sK0) = mult(sK2,sK0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl3_2
<=> mult(sK1,sK0) = mult(sK2,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f31,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f13,f28,f24]) ).
fof(f13,plain,
( mult(sK1,sK0) = mult(sK2,sK0)
| mult(sK0,sK2) = mult(sK0,sK1) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP711+1 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 04:24:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_PEQ problem
% 0.13/0.35 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.56/0.74 % (5244)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.56/0.75 % (5238)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.56/0.75 % (5240)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.75 % (5239)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.56/0.75 % (5241)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.56/0.75 % (5243)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.56/0.75 % (5245)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 (2996ds/56Mi)
% 0.56/0.75 % (5238)Refutation not found, incomplete strategy% (5238)------------------------------
% 0.56/0.75 % (5238)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (5245)Refutation not found, incomplete strategy% (5245)------------------------------
% 0.56/0.75 % (5245)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (5241)Refutation not found, incomplete strategy% (5241)------------------------------
% 0.56/0.75 % (5241)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (5245)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (5241)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (5245)Memory used [KB]: 953
% 0.56/0.75 % (5241)Memory used [KB]: 954
% 0.56/0.75 % (5245)Time elapsed: 0.002 s
% 0.56/0.75 % (5241)Time elapsed: 0.003 s
% 0.56/0.75 % (5245)Instructions burned: 2 (million)
% 0.56/0.75 % (5241)Instructions burned: 2 (million)
% 0.56/0.75 % (5238)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (5238)Memory used [KB]: 969
% 0.56/0.75 % (5238)Time elapsed: 0.003 s
% 0.56/0.75 % (5238)Instructions burned: 2 (million)
% 0.56/0.75 % (5241)------------------------------
% 0.56/0.75 % (5241)------------------------------
% 0.56/0.75 % (5245)------------------------------
% 0.56/0.75 % (5245)------------------------------
% 0.56/0.75 % (5238)------------------------------
% 0.56/0.75 % (5238)------------------------------
% 0.56/0.75 % (5248)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.56/0.75 % (5242)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.56/0.75 % (5246)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.56/0.75 % (5247)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.56/0.75 % (5242)Refutation not found, incomplete strategy% (5242)------------------------------
% 0.56/0.75 % (5242)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (5242)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (5242)Memory used [KB]: 968
% 0.56/0.75 % (5242)Time elapsed: 0.003 s
% 0.56/0.75 % (5242)Instructions burned: 2 (million)
% 0.56/0.75 % (5242)------------------------------
% 0.56/0.75 % (5242)------------------------------
% 0.56/0.75 % (5247)Refutation not found, incomplete strategy% (5247)------------------------------
% 0.56/0.75 % (5247)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (5247)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (5247)Memory used [KB]: 954
% 0.56/0.75 % (5247)Time elapsed: 0.003 s
% 0.56/0.75 % (5247)Instructions burned: 2 (million)
% 0.56/0.75 % (5247)------------------------------
% 0.56/0.75 % (5247)------------------------------
% 0.56/0.75 % (5240)First to succeed.
% 0.56/0.76 % (5240)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5237"
% 0.56/0.76 % (5240)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for theBenchmark
% 0.56/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.76 % (5240)------------------------------
% 0.56/0.76 % (5240)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (5240)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (5240)Memory used [KB]: 1080
% 0.56/0.76 % (5240)Time elapsed: 0.011 s
% 0.56/0.76 % (5240)Instructions burned: 16 (million)
% 0.56/0.76 % (5237)Success in time 0.4 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------