TSTP Solution File: GRP148-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP148-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 : n029.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:51:54 EDT 2024
% Result : Unsatisfiable 1.72s 0.61s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 22 unt; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 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 : 25 ( 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11702,plain,
$false,
inference(subsumption_resolution,[],[f11677,f18]) ).
fof(f18,axiom,
least_upper_bound(a,b) != greatest_lower_bound(least_upper_bound(a,b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1c) ).
fof(f11677,plain,
least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),c),
inference(superposition,[],[f29,f11624]) ).
fof(f11624,plain,
c = least_upper_bound(c,least_upper_bound(a,b)),
inference(forward_demodulation,[],[f11550,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(f11550,plain,
c = least_upper_bound(c,least_upper_bound(b,a)),
inference(superposition,[],[f11309,f842]) ).
fof(f842,plain,
a = greatest_lower_bound(c,a),
inference(superposition,[],[f129,f32]) ).
fof(f32,plain,
a = greatest_lower_bound(a,c),
inference(superposition,[],[f11,f16]) ).
fof(f16,axiom,
c = least_upper_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_1) ).
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(f129,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(X0,greatest_lower_bound(X1,X0)),
inference(superposition,[],[f105,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(f105,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(f11309,plain,
! [X0] : c = least_upper_bound(c,least_upper_bound(b,greatest_lower_bound(c,X0))),
inference(superposition,[],[f225,f21]) ).
fof(f21,plain,
c = least_upper_bound(c,b),
inference(superposition,[],[f5,f17]) ).
fof(f17,axiom,
c = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_2) ).
fof(f225,plain,
! [X2,X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(least_upper_bound(X0,X1),X2))),
inference(superposition,[],[f7,f10]) ).
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(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(f29,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP148-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 : n029.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 : Tue Apr 30 04:40:50 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % (25403)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (25408)WARNING: value z3 for option sas not known
% 0.14/0.38 % (25406)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (25409)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (25407)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 % (25408)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 % (25410)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.38 % (25411)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 % (25412)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.38 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]
% 0.21/0.56 TRYING [5]
% 1.56/0.59 TRYING [6]
% 1.72/0.60 % (25408)First to succeed.
% 1.72/0.61 % (25408)Refutation found. Thanks to Tanya!
% 1.72/0.61 % SZS status Unsatisfiable for theBenchmark
% 1.72/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.72/0.61 % (25408)------------------------------
% 1.72/0.61 % (25408)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 1.72/0.61 % (25408)Termination reason: Refutation
% 1.72/0.61
% 1.72/0.61 % (25408)Memory used [KB]: 4405
% 1.72/0.61 % (25408)Time elapsed: 0.223 s
% 1.72/0.61 % (25408)Instructions burned: 636 (million)
% 1.72/0.61 % (25408)------------------------------
% 1.72/0.61 % (25408)------------------------------
% 1.72/0.61 % (25403)Success in time 0.21 s
%------------------------------------------------------------------------------