TSTP Solution File: GRP146-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GRP146-1 : TPTP v8.2.0. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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:07:04 EDT 2024
% Result : Unsatisfiable 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,plain,
$false,
inference(subsumption_resolution,[],[f43,f16]) ).
fof(f16,axiom,
c = least_upper_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1a_1) ).
fof(f43,plain,
c != least_upper_bound(a,c),
inference(forward_demodulation,[],[f42,f21]) ).
fof(f21,plain,
c = least_upper_bound(c,b),
inference(superposition,[],[f17,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f17,axiom,
c = least_upper_bound(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1a_2) ).
fof(f42,plain,
c != least_upper_bound(a,least_upper_bound(c,b)),
inference(forward_demodulation,[],[f41,f5]) ).
fof(f41,plain,
c != least_upper_bound(a,least_upper_bound(b,c)),
inference(superposition,[],[f18,f7]) ).
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/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f18,axiom,
c != least_upper_bound(least_upper_bound(a,b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub1a) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP146-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.07/0.14 % 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.13/0.34 % Computer : n022.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 05:07:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.13/0.35 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.61/0.79 % (22611)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.61/0.79 % (22605)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.79 % (22607)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.79 % (22608)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.79 % (22606)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.79 % (22609)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.79 % (22610)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.79 % (22611)First to succeed.
% 0.61/0.79 % (22611)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22604"
% 0.61/0.79 % (22611)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Unsatisfiable for theBenchmark
% 0.61/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.79 % (22611)------------------------------
% 0.61/0.79 % (22611)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (22611)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (22611)Memory used [KB]: 1065
% 0.61/0.79 % (22611)Time elapsed: 0.003 s
% 0.61/0.79 % (22611)Instructions burned: 4 (million)
% 0.61/0.79 % (22604)Success in time 0.429 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------