TSTP Solution File: GRP186-3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP186-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 : Tue Apr 30 11:52:06 EDT 2024
% Result : Unsatisfiable 0.15s 0.41s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f806,plain,
$false,
inference(trivial_inequality_removal,[],[f805]) ).
fof(f805,plain,
least_upper_bound(identity,multiply(a,b)) != least_upper_bound(identity,multiply(a,b)),
inference(superposition,[],[f798,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(f798,plain,
least_upper_bound(multiply(a,b),identity) != least_upper_bound(identity,multiply(a,b)),
inference(backward_demodulation,[],[f16,f769]) ).
fof(f769,plain,
! [X0,X1] : multiply(X0,least_upper_bound(inverse(X0),X1)) = least_upper_bound(identity,multiply(X0,X1)),
inference(superposition,[],[f12,f264]) ).
fof(f264,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f176,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f176,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f134,f134]) ).
fof(f134,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f132,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f132,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
fof(f3,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
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(f16,axiom,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p23x) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP186-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n019.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 04:20:14 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (8683)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (8686)WARNING: value z3 for option sas not known
% 0.15/0.38 % (8687)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (8685)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (8684)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (8688)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (8686)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (8690)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % (8689)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.41 % (8689)First to succeed.
% 0.15/0.41 TRYING [3]
% 0.15/0.41 % (8689)Refutation found. Thanks to Tanya!
% 0.15/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.41 % (8689)------------------------------
% 0.15/0.41 % (8689)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.41 % (8689)Termination reason: Refutation
% 0.15/0.41
% 0.15/0.41 % (8689)Memory used [KB]: 1114
% 0.15/0.41 % (8689)Time elapsed: 0.029 s
% 0.15/0.41 % (8689)Instructions burned: 45 (million)
% 0.15/0.41 % (8689)------------------------------
% 0.15/0.41 % (8689)------------------------------
% 0.15/0.41 % (8683)Success in time 0.045 s
%------------------------------------------------------------------------------