%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP572-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:18:08 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(X1,double_divide(X0,X2)),double_divide(X2,identity))),double_divide(identity,identity)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f6,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f4,f3]) ).
fof(f7,plain,
double_divide(double_divide(b,a),identity) != double_divide(double_divide(a,b),identity),
inference(definition_unfolding,[],[f5,f2,f2]) ).
fof(f10,plain,
! [X0] : double_divide(double_divide(X0,double_divide(identity,double_divide(identity,identity))),double_divide(identity,identity)) = X0,
inference(superposition,[],[f1,f6]) ).
fof(f12,plain,
! [X0] : double_divide(double_divide(X0,identity),double_divide(identity,identity)) = X0,
inference(forward_demodulation,[],[f10,f6]) ).
fof(f13,plain,
! [X0] : double_divide(X0,identity) = double_divide(double_divide(identity,double_divide(X0,double_divide(identity,identity))),double_divide(identity,identity)),
inference(superposition,[],[f1,f12]) ).
fof(f15,plain,
double_divide(identity,identity) = double_divide(double_divide(identity,identity),double_divide(identity,identity)),
inference(superposition,[],[f13,f6]) ).
fof(f24,plain,
identity = double_divide(identity,identity),
inference(forward_demodulation,[],[f15,f12]) ).
fof(f25,plain,
! [X0] : double_divide(X0,identity) = double_divide(double_divide(identity,double_divide(X0,identity)),identity),
inference(superposition,[],[f13,f24]) ).
fof(f26,plain,
! [X0] : double_divide(double_divide(X0,identity),identity) = X0,
inference(superposition,[],[f12,f24]) ).
fof(f35,plain,
! [X0] : identity = double_divide(double_divide(X0,identity),X0),
inference(superposition,[],[f6,f26]) ).
fof(f59,plain,
! [X0] : double_divide(double_divide(identity,X0),identity) = X0,
inference(superposition,[],[f25,f26]) ).
fof(f64,plain,
! [X0] : double_divide(double_divide(X0,identity),double_divide(identity,identity)) = double_divide(identity,double_divide(X0,identity)),
inference(superposition,[],[f12,f25]) ).
fof(f70,plain,
! [X0] : double_divide(identity,double_divide(X0,identity)) = X0,
inference(forward_demodulation,[],[f64,f12]) ).
fof(f74,plain,
! [X0] : identity = double_divide(X0,double_divide(identity,X0)),
inference(superposition,[],[f35,f59]) ).
fof(f75,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,X0),
inference(superposition,[],[f26,f59]) ).
fof(f87,plain,
! [X0,X1] : double_divide(double_divide(identity,double_divide(double_divide(X1,X0),double_divide(double_divide(X0,identity),identity))),double_divide(identity,identity)) = X1,
inference(superposition,[],[f1,f70]) ).
fof(f88,plain,
! [X0,X1] : double_divide(double_divide(identity,double_divide(double_divide(X1,X0),double_divide(double_divide(X0,identity),identity))),identity) = X1,
inference(forward_demodulation,[],[f87,f24]) ).
fof(f91,plain,
! [X0,X1] : double_divide(double_divide(X1,X0),double_divide(double_divide(X0,identity),identity)) = X1,
inference(forward_demodulation,[],[f88,f59]) ).
fof(f93,plain,
! [X0,X1] : double_divide(double_divide(X1,X0),X0) = X1,
inference(forward_demodulation,[],[f91,f26]) ).
fof(f100,plain,
! [X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(X1,identity),double_divide(double_divide(identity,X0),identity))),double_divide(identity,identity)) = X1,
inference(superposition,[],[f1,f74]) ).
fof(f101,plain,
! [X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(X1,identity),double_divide(double_divide(identity,X0),identity))),identity) = X1,
inference(forward_demodulation,[],[f100,f24]) ).
fof(f104,plain,
! [X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(X1,identity),X0)),identity) = X1,
inference(forward_demodulation,[],[f101,f59]) ).
fof(f108,plain,
! [X0] : double_divide(identity,double_divide(identity,X0)) = X0,
inference(superposition,[],[f75,f59]) ).
fof(f225,plain,
! [X0,X1] : double_divide(identity,double_divide(X0,double_divide(double_divide(X1,identity),X0))) = X1,
inference(forward_demodulation,[],[f104,f75]) ).
fof(f227,plain,
! [X0,X1] : double_divide(X0,identity) = double_divide(identity,double_divide(X1,double_divide(X0,X1))),
inference(superposition,[],[f225,f26]) ).
fof(f289,plain,
! [X0,X1] : double_divide(identity,double_divide(X0,identity)) = double_divide(X1,double_divide(X0,X1)),
inference(superposition,[],[f108,f227]) ).
fof(f299,plain,
! [X0,X1] : double_divide(X1,double_divide(X0,X1)) = X0,
inference(forward_demodulation,[],[f289,f70]) ).
fof(f322,plain,
! [X0,X1] : double_divide(X1,X0) = double_divide(X0,X1),
inference(superposition,[],[f299,f93]) ).
fof(f442,plain,
double_divide(double_divide(a,b),identity) != double_divide(double_divide(a,b),identity),
inference(superposition,[],[f7,f322]) ).
fof(f443,plain,
$false,
inference(trivial_inequality_removal,[],[f442]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP572-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n011.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 10:07:30 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.50 % (2177178)Will run a generic schedule for satisfiability detection.
% 0.17/0.50 % (2177194)% WARNING: option uhcvi not known.
% 0.17/0.50 % (2177193)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3408102661_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50 % (2177197)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3266002383:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50 % (2177194)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2598369110:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50 % (2177196)dis+10_1_sil=32000:sp=arity:random_seed=2836001948:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50 % TRYING [1]
% 0.17/0.50 % TRYING [2]
% 0.17/0.50 % TRYING [3]
% 0.17/0.50 % TRYING [4]
% 0.17/0.50 % (2177195)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1744883290:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50 % (2177198)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2749097968:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50 % TRYING [5]
% 0.17/0.50 % (2177199)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=983938494:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50 % TRYING [6]
% 0.17/0.50 % (2177195) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2177178-2177195"...
% 0.17/0.50 % (2177195)...printing done.
% 0.17/0.50 % (2177195)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (2177195)------------------------------
% 0.17/0.50 % (2177195)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50 % (2177195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50 % (2177195)CaDiCaL version: 2.1.3
% 0.17/0.50 % (2177195)Termination reason: Refutation
% 0.17/0.50 % (2177195)Time elapsed: 0.022 s
% 0.17/0.50 % (2177195)Peak memory usage: 11 MB
% 0.17/0.50 % (2177195)Instructions burned: 16 (million)
% 0.17/0.50 % (2177178)Success in time 0.068 s
% 0.17/0.50 % Vampire exiting
%------------------------------------------------------------------------------