TSTP Solution File: GRP176-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP176-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 : Tue Apr 30 11:52:02 EDT 2024
% Result : Unsatisfiable 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 33
% Syntax : Number of formulae : 61 ( 33 unt; 0 def)
% Number of atoms : 97 ( 41 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 20 ~; 19 |; 0 &)
% ( 17 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 18 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 80 ( 80 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f157,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f25,f29,f33,f37,f41,f45,f49,f53,f65,f69,f73,f99,f119,f123,f127,f131,f156]) ).
fof(f156,plain,
( spl0_1
| ~ spl0_14
| ~ spl0_16 ),
inference(avatar_contradiction_clause,[],[f155]) ).
fof(f155,plain,
( $false
| spl0_1
| ~ spl0_14
| ~ spl0_16 ),
inference(trivial_inequality_removal,[],[f154]) ).
fof(f154,plain,
( multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,multiply(least_upper_bound(a,b),d))
| spl0_1
| ~ spl0_14
| ~ spl0_16 ),
inference(forward_demodulation,[],[f141,f126]) ).
fof(f126,plain,
( ! [X2,X0,X1] : multiply(least_upper_bound(X1,X2),X0) = least_upper_bound(multiply(X1,X0),multiply(X2,X0))
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f125,plain,
( spl0_16
<=> ! [X2,X0,X1] : multiply(least_upper_bound(X1,X2),X0) = least_upper_bound(multiply(X1,X0),multiply(X2,X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_16])]) ).
fof(f141,plain,
( multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,least_upper_bound(multiply(a,d),multiply(b,d)))
| spl0_1
| ~ spl0_14 ),
inference(superposition,[],[f20,f118]) ).
fof(f118,plain,
( ! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2))
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f117,plain,
( spl0_14
<=> ! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_14])]) ).
fof(f20,plain,
( multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))
| spl0_1 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f18,plain,
( spl0_1
<=> multiply(c,multiply(least_upper_bound(a,b),d)) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f131,plain,
spl0_17,
inference(avatar_split_clause,[],[f15,f129]) ).
fof(f129,plain,
( spl0_17
<=> ! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = greatest_lower_bound(multiply(X1,X0),multiply(X2,X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_17])]) ).
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(f127,plain,
spl0_16,
inference(avatar_split_clause,[],[f14,f125]) ).
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(f123,plain,
spl0_15,
inference(avatar_split_clause,[],[f13,f121]) ).
fof(f121,plain,
( spl0_15
<=> ! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_15])]) ).
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(f119,plain,
spl0_14,
inference(avatar_split_clause,[],[f12,f117]) ).
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(f99,plain,
( spl0_13
| ~ spl0_6
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f55,f47,f39,f97]) ).
fof(f97,plain,
( spl0_13
<=> ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_13])]) ).
fof(f39,plain,
( spl0_6
<=> ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f47,plain,
( spl0_8
<=> ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
fof(f55,plain,
( ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0
| ~ spl0_6
| ~ spl0_8 ),
inference(superposition,[],[f48,f40]) ).
fof(f40,plain,
( ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f48,plain,
( ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f73,plain,
spl0_12,
inference(avatar_split_clause,[],[f7,f71]) ).
fof(f71,plain,
( spl0_12
<=> ! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_12])]) ).
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(f69,plain,
spl0_11,
inference(avatar_split_clause,[],[f6,f67]) ).
fof(f67,plain,
( spl0_11
<=> ! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_11])]) ).
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(f65,plain,
spl0_10,
inference(avatar_split_clause,[],[f3,f63]) ).
fof(f63,plain,
( spl0_10
<=> ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
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(f53,plain,
spl0_9,
inference(avatar_split_clause,[],[f11,f51]) ).
fof(f51,plain,
( spl0_9
<=> ! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
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(f49,plain,
spl0_8,
inference(avatar_split_clause,[],[f10,f47]) ).
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(f45,plain,
spl0_7,
inference(avatar_split_clause,[],[f5,f43]) ).
fof(f43,plain,
( spl0_7
<=> ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
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(f41,plain,
spl0_6,
inference(avatar_split_clause,[],[f4,f39]) ).
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(f37,plain,
spl0_5,
inference(avatar_split_clause,[],[f2,f35]) ).
fof(f35,plain,
( spl0_5
<=> ! [X0] : identity = multiply(inverse(X0),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f33,plain,
spl0_4,
inference(avatar_split_clause,[],[f9,f31]) ).
fof(f31,plain,
( spl0_4
<=> ! [X0] : greatest_lower_bound(X0,X0) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f9,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
fof(f29,plain,
spl0_3,
inference(avatar_split_clause,[],[f8,f27]) ).
fof(f27,plain,
( spl0_3
<=> ! [X0] : least_upper_bound(X0,X0) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f8,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_lub) ).
fof(f25,plain,
spl0_2,
inference(avatar_split_clause,[],[f1,f23]) ).
fof(f23,plain,
( spl0_2
<=> ! [X0] : multiply(identity,X0) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f21,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f16,f18]) ).
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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 04:47:49 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (7335)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (7338)WARNING: value z3 for option sas not known
% 0.15/0.33 % (7337)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.33 % (7340)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.33 % (7339)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.33 % (7336)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.33 % (7341)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.33 % (7338)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.33 % (7342)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.33 TRYING [1]
% 0.15/0.33 TRYING [2]
% 0.15/0.33 % (7340)First to succeed.
% 0.15/0.33 TRYING [3]
% 0.15/0.33 TRYING [1]
% 0.15/0.33 % (7340)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.33 % (7340)------------------------------
% 0.15/0.33 % (7340)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.33 % (7340)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (7340)Memory used [KB]: 884
% 0.15/0.33 % (7340)Time elapsed: 0.007 s
% 0.15/0.33 % (7340)Instructions burned: 9 (million)
% 0.15/0.33 % (7340)------------------------------
% 0.15/0.33 % (7340)------------------------------
% 0.15/0.33 % (7335)Success in time 0.021 s
%------------------------------------------------------------------------------