TSTP Solution File: GRP146-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n006.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 : Wed Aug 31 16:14:34 EDT 2022
% Result : Unsatisfiable 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,plain,
$false,
inference(subsumption_resolution,[],[f26,f19]) ).
fof(f19,plain,
c = least_upper_bound(c,a),
inference(backward_demodulation,[],[f16,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f16,axiom,
c = least_upper_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1a_1) ).
fof(f26,plain,
c != least_upper_bound(c,a),
inference(superposition,[],[f21,f5]) ).
fof(f21,plain,
c != least_upper_bound(a,c),
inference(backward_demodulation,[],[f20,f17]) ).
fof(f17,axiom,
c = least_upper_bound(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1a_2) ).
fof(f20,plain,
c != least_upper_bound(a,least_upper_bound(b,c)),
inference(backward_demodulation,[],[f18,f7]) ).
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/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f18,axiom,
c != least_upper_bound(least_upper_bound(a,b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub1a) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP146-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 29 22:15:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % (27399)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.46 % (27399)First to succeed.
% 0.19/0.46 % (27399)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (27399)------------------------------
% 0.19/0.46 % (27399)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (27399)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (27399)Termination reason: Refutation
% 0.19/0.46
% 0.19/0.46 % (27399)Memory used [KB]: 5500
% 0.19/0.46 % (27399)Time elapsed: 0.060 s
% 0.19/0.46 % (27399)Instructions burned: 2 (million)
% 0.19/0.46 % (27399)------------------------------
% 0.19/0.46 % (27399)------------------------------
% 0.19/0.46 % (27393)Success in time 0.125 s
%------------------------------------------------------------------------------