TSTP Solution File: GRP176-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GRP176-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 : 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 : Wed Aug 31 16:14:43 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 17 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 4 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,plain,
$false,
inference(unit_resulting_resolution,[],[f38,f30,f43,f34]) ).
fof(f34,plain,
! [X2,X3,X0,X1] :
( ~ sQ0_eqProxy(X0,X1)
| ~ sQ0_eqProxy(X2,X3)
| sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3)) ),
inference(equality_proxy_axiom,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( sQ0_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
fof(f43,plain,
~ sQ0_eqProxy(multiply(c,multiply(least_upper_bound(a,b),d)),multiply(c,least_upper_bound(multiply(a,d),multiply(b,d)))),
inference(unit_resulting_resolution,[],[f27,f33,f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ sQ0_eqProxy(X0,X1)
| sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2) ),
inference(equality_proxy_axiom,[],[f17]) ).
fof(f33,plain,
~ sQ0_eqProxy(multiply(c,multiply(least_upper_bound(a,b),d)),least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))),
inference(equality_proxy_replacement,[],[f16,f17]) ).
fof(f16,axiom,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p07) ).
fof(f27,plain,
! [X2,X0,X1] : sQ0_eqProxy(multiply(X0,least_upper_bound(X1,X2)),least_upper_bound(multiply(X0,X1),multiply(X0,X2))),
inference(equality_proxy_replacement,[],[f12,f17]) ).
fof(f12,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f30,plain,
! [X2,X0,X1] : sQ0_eqProxy(multiply(least_upper_bound(X1,X2),X0),least_upper_bound(multiply(X1,X0),multiply(X2,X0))),
inference(equality_proxy_replacement,[],[f14,f17]) ).
fof(f14,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X1,X2),X0) = least_upper_bound(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f38,plain,
! [X0] : sQ0_eqProxy(X0,X0),
inference(equality_proxy_axiom,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP176-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n027.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 : Mon Aug 29 22:33:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.50 % (5004)lrs+10_1:1_amm=off:drc=off:sp=reverse_frequency:spb=goal_then_units:to=lpo:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.50 % (5026)lrs+10_1:2_bd=preordered:drc=off:fd=preordered:fde=unused:sp=const_min:to=lpo:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.51 % (5013)dis+10_1:1024_anc=all:drc=off:flr=on:fsr=off:sac=on:urr=on:i=292:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/292Mi)
% 0.20/0.51 % (5009)dis+31_8:1_br=off:fd=off:gs=on:lcm=reverse:nm=16:nwc=5.0:sp=reverse_arity:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (5008)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.51 % (5008)First to succeed.
% 0.20/0.51 % (5010)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.20/0.51 % (5010)Also succeeded, but the first one will report.
% 0.20/0.51 % (5006)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.51 % (5005)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51 % (5021)lrs+10_1:1024_drc=off:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/388Mi)
% 0.20/0.52 % (5019)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.52 % (5008)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (5008)------------------------------
% 0.20/0.52 % (5008)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (5008)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (5008)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (5008)Memory used [KB]: 5500
% 0.20/0.52 % (5008)Time elapsed: 0.118 s
% 0.20/0.52 % (5008)Instructions burned: 1 (million)
% 0.20/0.52 % (5008)------------------------------
% 0.20/0.52 % (5008)------------------------------
% 0.20/0.52 % (5000)Success in time 0.168 s
%------------------------------------------------------------------------------