%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP552-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:05 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.48s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(identity,X0),divide(divide(divide(X1,X0),X2),X1)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f5,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f6,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f7,plain,
divide(a,divide(identity,b)) != divide(b,divide(identity,a)),
inference(definition_unfolding,[],[f6,f2,f2]) ).
fof(f9,plain,
! [X0] : divide(a,divide(divide(X0,X0),b)) != divide(b,divide(divide(X0,X0),a)),
inference(superposition,[],[f7,f5]) ).
fof(f11,plain,
! [X2,X3,X0,X1] : divide(divide(divide(X0,X0),X1),divide(divide(divide(X2,X1),X3),X2)) = X3,
inference(superposition,[],[f1,f5]) ).
fof(f13,plain,
! [X0,X1] : divide(divide(identity,X0),divide(divide(identity,X1),X0)) = X1,
inference(superposition,[],[f1,f5]) ).
fof(f15,plain,
! [X2,X0,X1] : divide(divide(divide(X2,X1),X0),X2) = divide(divide(identity,X1),divide(X0,identity)),
inference(superposition,[],[f1,f1]) ).
fof(f16,plain,
! [X0,X1] : divide(X1,X0) = divide(divide(identity,X0),divide(identity,X1)),
inference(superposition,[],[f1,f5]) ).
fof(f38,plain,
! [X0] : divide(identity,divide(divide(identity,X0),identity)) = X0,
inference(superposition,[],[f13,f5]) ).
fof(f64,plain,
! [X0,X1] : divide(X0,divide(divide(X0,X1),identity)) = X1,
inference(superposition,[],[f1,f38]) ).
fof(f69,plain,
! [X0] : divide(X0,divide(identity,identity)) = X0,
inference(superposition,[],[f16,f38]) ).
fof(f85,plain,
! [X0] : divide(a,divide(divide(X0,X0),b)) != divide(b,divide(divide(identity,a),divide(identity,divide(X0,X0)))),
inference(superposition,[],[f9,f16]) ).
fof(f93,plain,
! [X0,X1] : divide(identity,X0) = divide(divide(identity,X1),divide(divide(X0,X1),identity)),
inference(superposition,[],[f1,f16]) ).
fof(f104,plain,
! [X0] : divide(X0,identity) = X0,
inference(forward_demodulation,[],[f69,f5]) ).
fof(f194,plain,
! [X2,X3,X0,X1] : divide(X0,divide(X1,X1)) = divide(divide(identity,X2),divide(divide(divide(divide(X3,X2),X0),X3),identity)),
inference(superposition,[],[f15,f11]) ).
fof(f262,plain,
! [X2,X3,X0,X1] : divide(divide(identity,X2),divide(divide(divide(X3,X2),X0),X3)) = divide(X0,divide(X1,X1)),
inference(forward_demodulation,[],[f194,f104]) ).
fof(f290,plain,
! [X0,X1] : divide(X0,divide(X1,X1)) = X0,
inference(forward_demodulation,[],[f262,f1]) ).
fof(f307,plain,
! [X0] : divide(a,divide(divide(identity,X0),divide(divide(b,X0),identity))) != divide(b,divide(divide(identity,a),divide(identity,divide(divide(b,X0),divide(b,X0))))),
inference(superposition,[],[f85,f15]) ).
fof(f322,plain,
! [X0] : divide(a,divide(divide(identity,X0),divide(divide(b,X0),identity))) != divide(b,divide(divide(identity,a),identity)),
inference(forward_demodulation,[],[f307,f290]) ).
fof(f326,plain,
! [X0] : divide(a,divide(divide(identity,X0),divide(divide(b,X0),identity))) != divide(divide(identity,divide(divide(identity,a),identity)),divide(identity,b)),
inference(forward_demodulation,[],[f322,f16]) ).
fof(f328,plain,
! [X0] : divide(a,divide(identity,b)) != divide(a,divide(divide(identity,X0),divide(divide(b,X0),identity))),
inference(forward_demodulation,[],[f326,f64]) ).
fof(f329,plain,
divide(a,divide(identity,b)) != divide(a,divide(identity,b)),
inference(forward_demodulation,[],[f328,f93]) ).
fof(f330,plain,
$false,
inference(trivial_inequality_removal,[],[f329]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP552-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 10:07:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.48 % (726013)Will run a generic schedule for satisfiability detection.
% 0.11/0.48 % (726019)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=171364248_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.48 % TRYING [1]
% 0.11/0.48 % TRYING [2]
% 0.11/0.48 % TRYING [3]
% 0.11/0.48 % TRYING [4]
% 0.11/0.48 % TRYING [5]
% 0.11/0.48 % (726023)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2826760457:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.48 % (726020)% WARNING: option uhcvi not known.
% 0.11/0.48 % (726025)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4035617465:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.48 % (726021)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4121296067:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.48 % (726020)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1197366284:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.48 % (726024)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2072473810:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.48 % (726022)dis+10_1_sil=32000:sp=arity:random_seed=2028049117:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.48 % TRYING [6]
% 0.11/0.48 % (726024) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-726013-726024"...
% 0.11/0.48 % (726024)...printing done.
% 0.11/0.48 % (726024)Refutation found. Thanks to Tanya!
% 0.11/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.48 % (726024)------------------------------
% 0.11/0.48 % (726024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.48 % (726024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.48 % (726024)CaDiCaL version: 2.1.3
% 0.11/0.48 % (726024)Termination reason: Refutation
% 0.11/0.48 % (726024)Time elapsed: 0.019 s
% 0.11/0.48 % (726024)Peak memory usage: 11 MB
% 0.11/0.48 % (726024)Instructions burned: 17 (million)
% 0.11/0.48 % (726013)Success in time 0.061 s
% 0.11/0.48 % Vampire exiting
%------------------------------------------------------------------------------