TSTP Solution File: GRP138-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GRP138-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n017.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 May 1 02:27:37 EDT 2024
% Result : Unsatisfiable 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f315,plain,
$false,
inference(subsumption_resolution,[],[f314,f21]) ).
fof(f21,plain,
sF0 != sF1,
inference(definition_folding,[],[f18,f20,f19,f19]) ).
fof(f19,plain,
greatest_lower_bound(a,b) = sF0,
introduced(function_definition,[new_symbols(definition,[sF0])]) ).
fof(f20,plain,
least_upper_bound(sF0,c) = sF1,
introduced(function_definition,[new_symbols(definition,[sF1])]) ).
fof(f18,axiom,
greatest_lower_bound(a,b) != least_upper_bound(greatest_lower_bound(a,b),c),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',prove_ax_glb1a) ).
fof(f314,plain,
sF0 = sF1,
inference(forward_demodulation,[],[f313,f40]) ).
fof(f40,plain,
sF0 = greatest_lower_bound(sF0,sF1),
inference(superposition,[],[f11,f20]) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',glb_absorbtion) ).
fof(f313,plain,
sF1 = greatest_lower_bound(sF0,sF1),
inference(forward_demodulation,[],[f308,f227]) ).
fof(f227,plain,
sF1 = greatest_lower_bound(a,sF1),
inference(superposition,[],[f224,f4]) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',symmetry_of_glb) ).
fof(f224,plain,
sF1 = greatest_lower_bound(sF1,a),
inference(superposition,[],[f35,f221]) ).
fof(f221,plain,
a = least_upper_bound(a,sF1),
inference(forward_demodulation,[],[f215,f33]) ).
fof(f33,plain,
a = least_upper_bound(a,sF0),
inference(superposition,[],[f10,f19]) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',lub_absorbtion) ).
fof(f215,plain,
least_upper_bound(a,sF0) = least_upper_bound(a,sF1),
inference(superposition,[],[f84,f23]) ).
fof(f23,plain,
sF1 = least_upper_bound(c,sF0),
inference(superposition,[],[f5,f20]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',symmetry_of_lub) ).
fof(f84,plain,
! [X0] : least_upper_bound(a,least_upper_bound(c,X0)) = least_upper_bound(a,X0),
inference(superposition,[],[f7,f16]) ).
fof(f16,axiom,
a = least_upper_bound(a,c),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',ax_glb1a_1) ).
fof(f7,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',associativity_of_lub) ).
fof(f35,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f308,plain,
greatest_lower_bound(sF0,sF1) = greatest_lower_bound(a,sF1),
inference(superposition,[],[f52,f250]) ).
fof(f250,plain,
sF1 = greatest_lower_bound(b,sF1),
inference(superposition,[],[f247,f4]) ).
fof(f247,plain,
sF1 = greatest_lower_bound(sF1,b),
inference(superposition,[],[f35,f244]) ).
fof(f244,plain,
b = least_upper_bound(b,sF1),
inference(forward_demodulation,[],[f238,f73]) ).
fof(f73,plain,
b = least_upper_bound(b,sF0),
inference(superposition,[],[f31,f19]) ).
fof(f31,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
fof(f238,plain,
least_upper_bound(b,sF0) = least_upper_bound(b,sF1),
inference(superposition,[],[f85,f23]) ).
fof(f85,plain,
! [X0] : least_upper_bound(b,least_upper_bound(c,X0)) = least_upper_bound(b,X0),
inference(superposition,[],[f7,f17]) ).
fof(f17,axiom,
b = least_upper_bound(b,c),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',ax_glb1a_2) ).
fof(f52,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(b,X0)) = greatest_lower_bound(sF0,X0),
inference(superposition,[],[f6,f19]) ).
fof(f6,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314',associativity_of_glb) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP138-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/0.15 % 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.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:56:04 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a CNF_UNS_RFO_PEQ_UEQ 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/tmp/tmp.rfwZTfA2xw/Vampire---4.8_1314
% 0.57/0.75 % (1571)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 Vampire---4 for (2996ds/83Mi)
% 0.57/0.75 % (1565)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.75 % (1566)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 Vampire---4 for (2996ds/51Mi)
% 0.57/0.75 % (1567)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.75 % (1569)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.75 % (1570)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.75 % (1569)Refutation not found, incomplete strategy% (1569)------------------------------
% 0.57/0.75 % (1569)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (1565)Refutation not found, incomplete strategy% (1565)------------------------------
% 0.57/0.75 % (1565)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (1569)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (1569)Memory used [KB]: 984
% 0.57/0.75 % (1569)Time elapsed: 0.002 s
% 0.57/0.75 % (1569)Instructions burned: 2 (million)
% 0.57/0.75 % (1569)------------------------------
% 0.57/0.75 % (1569)------------------------------
% 0.57/0.75 % (1565)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (1565)Memory used [KB]: 985
% 0.57/0.75 % (1565)Time elapsed: 0.003 s
% 0.57/0.75 % (1565)Instructions burned: 3 (million)
% 0.57/0.75 % (1565)------------------------------
% 0.57/0.75 % (1565)------------------------------
% 0.57/0.75 % (1572)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.57/0.75 % (1572)Refutation not found, incomplete strategy% (1572)------------------------------
% 0.57/0.75 % (1572)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (1572)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (1568)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.75 % (1572)Memory used [KB]: 970
% 0.57/0.75 % (1572)Time elapsed: 0.002 s
% 0.57/0.75 % (1572)Instructions burned: 2 (million)
% 0.57/0.75 % (1572)------------------------------
% 0.57/0.75 % (1572)------------------------------
% 0.57/0.75 % (1568)Refutation not found, incomplete strategy% (1568)------------------------------
% 0.57/0.75 % (1568)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (1568)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (1568)Memory used [KB]: 972
% 0.57/0.75 % (1568)Time elapsed: 0.004 s
% 0.57/0.75 % (1568)Instructions burned: 2 (million)
% 0.57/0.75 % (1568)------------------------------
% 0.57/0.75 % (1568)------------------------------
% 0.57/0.75 % (1573)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 Vampire---4 for (2996ds/55Mi)
% 0.57/0.76 % (1575)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.57/0.76 % (1574)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 Vampire---4 for (2996ds/50Mi)
% 0.57/0.76 % (1574)Refutation not found, incomplete strategy% (1574)------------------------------
% 0.57/0.76 % (1574)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (1574)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (1574)Memory used [KB]: 968
% 0.57/0.76 % (1574)Time elapsed: 0.002 s
% 0.57/0.76 % (1574)Instructions burned: 2 (million)
% 0.57/0.76 % (1574)------------------------------
% 0.57/0.76 % (1574)------------------------------
% 0.60/0.76 % (1576)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.60/0.77 % (1575)First to succeed.
% 0.60/0.77 % (1575)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Unsatisfiable for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (1575)------------------------------
% 0.60/0.77 % (1575)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.77 % (1575)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (1575)Memory used [KB]: 1157
% 0.60/0.77 % (1575)Time elapsed: 0.013 s
% 0.60/0.77 % (1575)Instructions burned: 19 (million)
% 0.60/0.77 % (1575)------------------------------
% 0.60/0.77 % (1575)------------------------------
% 0.60/0.77 % (1561)Success in time 0.394 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------