TSTP Solution File: GRP709-1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : GRP709-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n001.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 : Mon Jun 24 07:20:19 EDT 2024
% Result : Unsatisfiable 0.12s 0.41s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f105,plain,
$false,
inference(trivial_inequality_removal,[],[f104]) ).
fof(f104,plain,
mult(a,mult(b,mult(op_c,op_c))) != mult(a,mult(b,mult(op_c,op_c))),
inference(forward_demodulation,[],[f103,f11]) ).
fof(f11,plain,
! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(op_c,mult(X0,X1)),
inference(forward_demodulation,[],[f9,f8]) ).
fof(f8,axiom,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f9,axiom,
! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f103,plain,
mult(a,mult(op_c,mult(b,op_c))) != mult(a,mult(b,mult(op_c,op_c))),
inference(forward_demodulation,[],[f102,f56]) ).
fof(f56,plain,
! [X0,X1] : mult(op_c,mult(op_c,mult(X0,X1))) = mult(X0,mult(op_c,mult(X1,op_c))),
inference(forward_demodulation,[],[f44,f8]) ).
fof(f44,plain,
! [X0,X1] : mult(X0,mult(mult(X1,op_c),op_c)) = mult(op_c,mult(op_c,mult(X0,X1))),
inference(superposition,[],[f11,f11]) ).
fof(f102,plain,
mult(a,mult(b,mult(op_c,op_c))) != mult(op_c,mult(op_c,mult(a,b))),
inference(forward_demodulation,[],[f101,f95]) ).
fof(f95,plain,
! [X0,X1] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(forward_demodulation,[],[f73,f6]) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f73,plain,
! [X0,X1] : mult(X0,mult(unit,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[],[f7,f6]) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X0,X2))) = mult(mult(X0,mult(X1,X0)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f101,plain,
mult(mult(op_c,op_c),mult(a,b)) != mult(a,mult(b,mult(op_c,op_c))),
inference(forward_demodulation,[],[f100,f11]) ).
fof(f100,plain,
mult(mult(op_c,op_c),mult(a,b)) != mult(a,mult(op_c,mult(b,op_c))),
inference(forward_demodulation,[],[f99,f11]) ).
fof(f99,plain,
mult(mult(op_c,op_c),mult(a,b)) != mult(a,mult(op_c,mult(op_c,b))),
inference(forward_demodulation,[],[f98,f8]) ).
fof(f98,plain,
mult(mult(op_c,op_c),mult(a,b)) != mult(a,mult(mult(op_c,b),op_c)),
inference(forward_demodulation,[],[f97,f11]) ).
fof(f97,plain,
mult(mult(op_c,op_c),mult(a,b)) != mult(op_c,mult(a,mult(op_c,b))),
inference(forward_demodulation,[],[f96,f70]) ).
fof(f70,plain,
! [X0,X1] : mult(op_c,mult(X0,mult(op_c,X1))) = mult(mult(op_c,mult(op_c,X0)),X1),
inference(superposition,[],[f7,f8]) ).
fof(f96,plain,
mult(mult(op_c,op_c),mult(a,b)) != mult(mult(op_c,mult(op_c,a)),b),
inference(backward_demodulation,[],[f10,f95]) ).
fof(f10,axiom,
mult(mult(op_c,op_c),mult(a,b)) != mult(mult(mult(op_c,op_c),a),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP709-1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n001.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 : Thu Jun 20 10:31:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running /export/starexec/sandbox/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40 % (18771)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.40 % (18779)lrs+10_85441:1048576_drc=encompass:sil=64000:i=401:awrs=converge:sp=reverse_frequency:dpc=on:bd=preordered:fsr=off:ss=included:st=3.0:fde=none_0 on theBenchmark for (3000ds/401Mi)
% 0.12/0.41 % (18779)First to succeed.
% 0.12/0.41 % (18779)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18771"
% 0.12/0.41 % (18771)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.41 % (18779)Refutation found. Thanks to Tanya!
% 0.12/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.41 % (18779)------------------------------
% 0.12/0.41 % (18779)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.12/0.41 % (18779)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.12/0.41 % (18779)Termination reason: Refutation
% 0.12/0.41
% 0.12/0.41 % (18779)Memory used [KB]: 853
% 0.12/0.41 % (18779)Time elapsed: 0.006 s
% 0.12/0.41 % (18779)Instructions burned: 9 (million)
% 0.12/0.41 % (18779)------------------------------
% 0.12/0.41 % (18779)------------------------------
% 0.12/0.41 % (18771)Success in time 0.051 s
%------------------------------------------------------------------------------