TSTP Solution File: GRP581-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : GRP581-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n024.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:22:55 EDT 2022
% Result : Unsatisfiable 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 16 unt; 3 typ; 0 def)
% Number of atoms : 16 ( 15 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 : 6 ( 2 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_2,type,
sQ1_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_3,type,
sQ2_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_4,type,
sQ3_eqProxy: ( $real * $real ) > $o ).
fof(f52,plain,
$false,
inference(subsumption_resolution,[],[f51,f37]) ).
fof(f37,plain,
identity != double_divide(identity,identity),
inference(backward_demodulation,[],[f10,f9]) ).
fof(f9,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(literal_reordering,[],[f6]) ).
fof(f6,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f4,f3]) ).
fof(f3,axiom,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f10,plain,
identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
inference(literal_reordering,[],[f7]) ).
fof(f7,plain,
identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
inference(definition_unfolding,[],[f5,f2,f3]) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f5,axiom,
identity != multiply(inverse(a1),a1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f51,plain,
identity = double_divide(identity,identity),
inference(forward_demodulation,[],[f50,f9]) ).
fof(f50,plain,
double_divide(identity,identity) = double_divide(identity,double_divide(identity,identity)),
inference(forward_demodulation,[],[f47,f9]) ).
fof(f47,plain,
double_divide(identity,identity) = double_divide(double_divide(identity,double_divide(identity,identity)),double_divide(identity,identity)),
inference(superposition,[],[f44,f9]) ).
fof(f44,plain,
! [X0] : double_divide(double_divide(identity,double_divide(double_divide(identity,X0),identity)),double_divide(identity,identity)) = X0,
inference(superposition,[],[f8,f9]) ).
fof(f8,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(identity,X1),double_divide(X2,double_divide(X1,X0)))),double_divide(identity,identity)) = X2,
inference(literal_reordering,[],[f1]) ).
fof(f1,axiom,
! [X2,X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(identity,X1),double_divide(X2,double_divide(X1,X0)))),double_divide(identity,identity)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP581-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 22:35:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 % (8506)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.21/0.47 % (8506)First to succeed.
% 0.21/0.48 % (8503)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.21/0.48 % (8496)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.21/0.48 % (8506)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48 % (8506)------------------------------
% 0.21/0.48 % (8506)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48 % (8506)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48 % (8506)Termination reason: Refutation
% 0.21/0.48
% 0.21/0.48 % (8506)Memory used [KB]: 5756
% 0.21/0.48 % (8506)Time elapsed: 0.005 s
% 0.21/0.48 % (8506)Instructions burned: 4 (million)
% 0.21/0.48 % (8506)------------------------------
% 0.21/0.48 % (8506)------------------------------
% 0.21/0.48 % (8488)Success in time 0.129 s
%------------------------------------------------------------------------------