TSTP Solution File: GRP170-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP170-1 : 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 : 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 : Sun May 5 05:53:51 EDT 2024
% Result : Unsatisfiable 41.89s 6.33s
% Output : Refutation 41.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 40 ( 40 unt; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f218394,plain,
$false,
inference(subsumption_resolution,[],[f218393,f18]) ).
fof(f18,axiom,
multiply(b,d) != least_upper_bound(multiply(a,c),multiply(b,d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03a) ).
fof(f218393,plain,
multiply(b,d) = least_upper_bound(multiply(a,c),multiply(b,d)),
inference(forward_demodulation,[],[f217974,f132]) ).
fof(f132,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f126,f126]) ).
fof(f126,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f124,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f124,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
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(f217974,plain,
multiply(inverse(inverse(b)),d) = least_upper_bound(multiply(a,c),multiply(inverse(inverse(b)),d)),
inference(superposition,[],[f470,f109160]) ).
fof(f109160,plain,
d = least_upper_bound(multiply(inverse(b),multiply(a,c)),d),
inference(forward_demodulation,[],[f109019,f36]) ).
fof(f36,plain,
d = least_upper_bound(d,c),
inference(superposition,[],[f20,f23]) ).
fof(f23,plain,
c = greatest_lower_bound(c,d),
inference(superposition,[],[f11,f17]) ).
fof(f17,axiom,
d = least_upper_bound(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03a_2) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f20,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
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(f109019,plain,
least_upper_bound(d,c) = least_upper_bound(multiply(inverse(b),multiply(a,c)),d),
inference(superposition,[],[f5478,f99250]) ).
fof(f99250,plain,
! [X0] : least_upper_bound(X0,multiply(inverse(b),multiply(a,X0))) = X0,
inference(superposition,[],[f19839,f799]) ).
fof(f799,plain,
a = greatest_lower_bound(b,a),
inference(superposition,[],[f394,f22]) ).
fof(f22,plain,
a = greatest_lower_bound(a,b),
inference(superposition,[],[f11,f16]) ).
fof(f16,axiom,
b = least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03a_1) ).
fof(f394,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(X0,greatest_lower_bound(X1,X0)),
inference(superposition,[],[f200,f4]) ).
fof(f200,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f6,f9]) ).
fof(f9,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
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/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f19839,plain,
! [X2,X0,X1] : least_upper_bound(X2,multiply(inverse(X0),multiply(greatest_lower_bound(X0,X1),X2))) = X2,
inference(forward_demodulation,[],[f19838,f1]) ).
fof(f19838,plain,
! [X2,X0,X1] : multiply(identity,X2) = least_upper_bound(multiply(identity,X2),multiply(inverse(X0),multiply(greatest_lower_bound(X0,X1),X2))),
inference(forward_demodulation,[],[f19686,f3]) ).
fof(f19686,plain,
! [X2,X0,X1] : multiply(identity,X2) = least_upper_bound(multiply(identity,X2),multiply(multiply(inverse(X0),greatest_lower_bound(X0,X1)),X2)),
inference(superposition,[],[f1108,f654]) ).
fof(f654,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f2]) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f1108,plain,
! [X2,X0,X1] : multiply(X0,X1) = least_upper_bound(multiply(X0,X1),multiply(greatest_lower_bound(X0,X2),X1)),
inference(superposition,[],[f10,f15]) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = greatest_lower_bound(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f5478,plain,
! [X0] : least_upper_bound(d,least_upper_bound(c,X0)) = least_upper_bound(X0,d),
inference(superposition,[],[f304,f36]) ).
fof(f304,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(superposition,[],[f7,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(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(f470,plain,
! [X2,X0,X1] : multiply(inverse(X0),least_upper_bound(multiply(X0,X1),X2)) = least_upper_bound(X1,multiply(inverse(X0),X2)),
inference(superposition,[],[f12,f126]) ).
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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP170-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 20:49:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % (23711)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (23714)WARNING: value z3 for option sas not known
% 0.14/0.38 % (23715)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (23713)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (23712)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (23714)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.14/0.38 % (23717)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.14/0.38 % (23716)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.14/0.39 % (23718)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.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.41 TRYING [3]
% 0.14/0.41 TRYING [4]
% 0.21/0.46 TRYING [4]
% 0.21/0.48 TRYING [5]
% 1.66/0.61 TRYING [6]
% 1.66/0.63 TRYING [5]
% 5.04/1.10 TRYING [7]
% 7.77/1.48 TRYING [1]
% 7.77/1.48 TRYING [2]
% 7.77/1.49 TRYING [3]
% 8.10/1.51 TRYING [4]
% 8.37/1.60 TRYING [5]
% 10.35/1.87 TRYING [6]
% 13.15/2.30 TRYING [6]
% 15.77/2.66 TRYING [7]
% 15.77/2.67 TRYING [8]
% 34.24/5.29 TRYING [8]
% 35.30/5.44 TRYING [9]
% 41.89/6.32 % (23714)First to succeed.
% 41.89/6.32 % (23714)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23711"
% 41.89/6.33 % (23714)Refutation found. Thanks to Tanya!
% 41.89/6.33 % SZS status Unsatisfiable for theBenchmark
% 41.89/6.33 % SZS output start Proof for theBenchmark
% See solution above
% 41.89/6.33 % (23714)------------------------------
% 41.89/6.33 % (23714)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 41.89/6.33 % (23714)Termination reason: Refutation
% 41.89/6.33
% 41.89/6.33 % (23714)Memory used [KB]: 73635
% 41.89/6.33 % (23714)Time elapsed: 5.940 s
% 41.89/6.33 % (23714)Instructions burned: 26481 (million)
% 41.89/6.33 % (23711)Success in time 5.921 s
%------------------------------------------------------------------------------