TSTP Solution File: GRP149-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GRP149-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n026.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 Aug 31 16:14:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f80,plain,
$false,
inference(subsumption_resolution,[],[f79,f31]) ).
fof(f31,plain,
c != least_upper_bound(a,c),
inference(backward_demodulation,[],[f20,f30]) ).
fof(f30,plain,
c = least_upper_bound(c,b),
inference(superposition,[],[f10,f21]) ).
fof(f21,plain,
b = greatest_lower_bound(c,b),
inference(superposition,[],[f4,f17]) ).
fof(f17,axiom,
b = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1d_2) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f20,plain,
c != least_upper_bound(a,least_upper_bound(c,b)),
inference(backward_demodulation,[],[f19,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f19,plain,
c != least_upper_bound(a,least_upper_bound(b,c)),
inference(forward_demodulation,[],[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/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f18,axiom,
c != least_upper_bound(least_upper_bound(a,b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1d) ).
fof(f79,plain,
c = least_upper_bound(a,c),
inference(superposition,[],[f5,f48]) ).
fof(f48,plain,
c = least_upper_bound(c,a),
inference(superposition,[],[f26,f16]) ).
fof(f16,axiom,
a = greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1d_1) ).
fof(f26,plain,
! [X2,X1] : least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(superposition,[],[f10,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP149-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 22:31:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.55 % (19872)lrs+10_1:128_plsq=on:plsqc=2:s2a=on:ss=axioms:st=1.5:urr=on:i=321:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/321Mi)
% 0.20/0.55 % (19884)dis+10_1:1024_av=off:bd=preordered:drc=off:nwc=3.0:rp=on:thsq=on:thsqc=64:thsqd=32:to=lpo:i=267:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/267Mi)
% 0.20/0.56 % (19868)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.56 % (19876)lrs+1011_1:1_asg=cautious:bsr=on:cond=on:drc=off:etr=on:fd=preordered:gs=on:plsq=on:plsqr=388,511:slsq=on:slsqc=1:slsqr=21,31:urr=on:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.57 % (19876)First to succeed.
% 0.20/0.57 % (19864)lrs+10_1:1_avsq=on:avsql=on:bsr=unit_only:drc=off:fsr=off:inw=on:nwc=10.0:rnwc=on:sgt=16:slsq=on:slsqc=0:slsql=off:slsqr=211,119:sp=reverse_frequency:spb=goal_then_units:ss=included:st=2.0:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.57 % (19871)dis+2_1:1024_abs=on:alpa=false:anc=all_dependent:avsq=on:bce=on:drc=off:newcnf=on:slsq=on:slsqc=0:slsqr=1,1:sp=reverse_arity:i=353:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/353Mi)
% 0.20/0.57 % (19858)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99788:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99788Mi)
% 0.20/0.58 % (19863)lrs+10_1:1_br=off:ep=RSTC:sos=all:urr=on:i=20:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/20Mi)
% 0.20/0.58 % (19876)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (19876)------------------------------
% 0.20/0.58 % (19876)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (19876)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (19876)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (19876)Memory used [KB]: 10106
% 0.20/0.58 % (19876)Time elapsed: 0.145 s
% 0.20/0.58 % (19876)Instructions burned: 7 (million)
% 0.20/0.58 % (19876)------------------------------
% 0.20/0.58 % (19876)------------------------------
% 0.20/0.58 % (19857)Success in time 0.22 s
%------------------------------------------------------------------------------