TSTP Solution File: GRP143-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP143-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 : 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 : Tue Apr 30 11:51:53 EDT 2024
% Result : Unsatisfiable 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 26
% Syntax : Number of formulae : 52 ( 25 unt; 0 def)
% Number of atoms : 87 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 57 ( 22 ~; 21 |; 0 &)
% ( 14 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 15 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f113,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f27,f31,f35,f39,f43,f47,f51,f55,f59,f73,f77,f81,f92,f112]) ).
fof(f112,plain,
( spl0_2
| ~ spl0_5
| ~ spl0_12 ),
inference(avatar_contradiction_clause,[],[f111]) ).
fof(f111,plain,
( $false
| spl0_2
| ~ spl0_5
| ~ spl0_12 ),
inference(trivial_inequality_removal,[],[f110]) ).
fof(f110,plain,
( greatest_lower_bound(b,a) != greatest_lower_bound(b,a)
| spl0_2
| ~ spl0_5
| ~ spl0_12 ),
inference(forward_demodulation,[],[f107,f38]) ).
fof(f38,plain,
( ! [X0] : greatest_lower_bound(X0,X0) = X0
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl0_5
<=> ! [X0] : greatest_lower_bound(X0,X0) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f107,plain,
( greatest_lower_bound(b,a) != greatest_lower_bound(b,greatest_lower_bound(a,a))
| spl0_2
| ~ spl0_12 ),
inference(superposition,[],[f26,f76]) ).
fof(f76,plain,
( ! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f75,plain,
( spl0_12
<=> ! [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_12])]) ).
fof(f26,plain,
( greatest_lower_bound(b,a) != greatest_lower_bound(greatest_lower_bound(b,a),a)
| spl0_2 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl0_2
<=> greatest_lower_bound(b,a) = greatest_lower_bound(greatest_lower_bound(b,a),a) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f92,plain,
( ~ spl0_14
| spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f60,f45,f24,f89]) ).
fof(f89,plain,
( spl0_14
<=> greatest_lower_bound(b,a) = greatest_lower_bound(a,greatest_lower_bound(b,a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_14])]) ).
fof(f45,plain,
( spl0_7
<=> ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
fof(f60,plain,
( greatest_lower_bound(b,a) != greatest_lower_bound(a,greatest_lower_bound(b,a))
| spl0_2
| ~ spl0_7 ),
inference(superposition,[],[f26,f46]) ).
fof(f46,plain,
( ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f81,plain,
spl0_13,
inference(avatar_split_clause,[],[f7,f79]) ).
fof(f79,plain,
( spl0_13
<=> ! [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_13])]) ).
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(f77,plain,
spl0_12,
inference(avatar_split_clause,[],[f6,f75]) ).
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(f73,plain,
spl0_11,
inference(avatar_split_clause,[],[f3,f71]) ).
fof(f71,plain,
( spl0_11
<=> ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_11])]) ).
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(f59,plain,
spl0_10,
inference(avatar_split_clause,[],[f11,f57]) ).
fof(f57,plain,
( spl0_10
<=> ! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
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(f55,plain,
spl0_9,
inference(avatar_split_clause,[],[f10,f53]) ).
fof(f53,plain,
( spl0_9
<=> ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
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(f51,plain,
spl0_8,
inference(avatar_split_clause,[],[f5,f49]) ).
fof(f49,plain,
( spl0_8
<=> ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
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(f47,plain,
spl0_7,
inference(avatar_split_clause,[],[f4,f45]) ).
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(f43,plain,
spl0_6,
inference(avatar_split_clause,[],[f2,f41]) ).
fof(f41,plain,
( spl0_6
<=> ! [X0] : identity = multiply(inverse(X0),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f39,plain,
spl0_5,
inference(avatar_split_clause,[],[f9,f37]) ).
fof(f9,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
fof(f35,plain,
spl0_4,
inference(avatar_split_clause,[],[f8,f33]) ).
fof(f33,plain,
( spl0_4
<=> ! [X0] : least_upper_bound(X0,X0) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f8,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_lub) ).
fof(f31,plain,
spl0_3,
inference(avatar_split_clause,[],[f1,f29]) ).
fof(f29,plain,
( spl0_3
<=> ! [X0] : multiply(identity,X0) = X0 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f27,plain,
( ~ spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f22,f18,f24]) ).
fof(f18,plain,
( spl0_1
<=> greatest_lower_bound(a,b) = greatest_lower_bound(greatest_lower_bound(a,b),a) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f22,plain,
( greatest_lower_bound(b,a) != greatest_lower_bound(greatest_lower_bound(b,a),a)
| spl0_1 ),
inference(forward_demodulation,[],[f20,f4]) ).
fof(f20,plain,
( greatest_lower_bound(a,b) != greatest_lower_bound(greatest_lower_bound(a,b),a)
| spl0_1 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f21,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f16,f18]) ).
fof(f16,axiom,
greatest_lower_bound(a,b) != greatest_lower_bound(greatest_lower_bound(a,b),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb2b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP143-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 04:48:02 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (13391)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (13396)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.37 % (13396)First to succeed.
% 0.14/0.37 % (13396)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (13396)------------------------------
% 0.14/0.37 % (13396)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.37 % (13396)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (13396)Memory used [KB]: 871
% 0.14/0.37 % (13396)Time elapsed: 0.003 s
% 0.14/0.37 % (13396)Instructions burned: 7 (million)
% 0.14/0.37 % (13396)------------------------------
% 0.14/0.37 % (13396)------------------------------
% 0.14/0.37 % (13391)Success in time 0.013 s
%------------------------------------------------------------------------------