%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP449-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:17:51 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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; 2 con; 0-2 aty)
% Number of variables : 52 ( 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(divide(divide(X1,X1),X0),X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,plain,
! [X0,X1] : divide(divide(X1,X1),X0) = inverse(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f6,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f5]) ).
fof(f7,plain,
! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
inference(superposition,[],[f4,f4]) ).
fof(f16,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f2,f4]) ).
fof(f17,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(divide(X1,X1),X0),
inference(superposition,[],[f16,f4]) ).
fof(f29,plain,
! [X0,X1] : inverse(inverse(X1)) = multiply(multiply(inverse(X0),X0),X1),
inference(superposition,[],[f17,f16]) ).
fof(f51,plain,
a2 != inverse(inverse(a2)),
inference(superposition,[],[f6,f29]) ).
fof(f316,plain,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(inverse(X0),X2))) = X1,
inference(forward_demodulation,[],[f1,f4]) ).
fof(f317,plain,
! [X2,X0,X1] : divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(forward_demodulation,[],[f316,f4]) ).
fof(f344,plain,
! [X0,X1] : divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[],[f317,f4]) ).
fof(f358,plain,
! [X2,X0,X1] : inverse(divide(divide(inverse(X0),X2),divide(inverse(divide(X1,X1)),X2))) = X0,
inference(superposition,[],[f4,f317]) ).
fof(f381,plain,
! [X2,X0] : inverse(divide(divide(inverse(X0),X2),inverse(X2))) = X0,
inference(forward_demodulation,[],[f358,f7]) ).
fof(f393,plain,
! [X0,X1] : multiply(X0,divide(inverse(X0),inverse(X1))) = X1,
inference(forward_demodulation,[],[f344,f16]) ).
fof(f417,plain,
! [X2,X0] : inverse(multiply(divide(inverse(X0),X2),X2)) = X0,
inference(forward_demodulation,[],[f381,f16]) ).
fof(f429,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f393,f16]) ).
fof(f450,plain,
! [X0,X1] : multiply(inverse(inverse(X1)),X0) = multiply(X1,X0),
inference(superposition,[],[f429,f429]) ).
fof(f533,plain,
! [X0,X1] : divide(X1,X1) = inverse(multiply(inverse(X0),X0)),
inference(superposition,[],[f417,f7]) ).
fof(f704,plain,
! [X0,X1] : divide(X1,X1) = divide(X0,X0),
inference(superposition,[],[f533,f533]) ).
fof(f873,plain,
! [X0,X1] : divide(X1,divide(X0,X0)) = X1,
inference(superposition,[],[f317,f704]) ).
fof(f963,plain,
! [X0,X1] : divide(X1,inverse(divide(X0,X0))) = X1,
inference(superposition,[],[f873,f4]) ).
fof(f1052,plain,
! [X0,X1] : multiply(X1,divide(X0,X0)) = X1,
inference(forward_demodulation,[],[f963,f16]) ).
fof(f1110,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(X0,divide(X1,X1)),
inference(superposition,[],[f450,f1052]) ).
fof(f1121,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f1110,f1052]) ).
fof(f1182,plain,
a2 != a2,
inference(superposition,[],[f51,f1121]) ).
fof(f1202,plain,
$false,
inference(trivial_inequality_removal,[],[f1182]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP449-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n010.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 10:05:16 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.18/0.49 % (719799)Will run a generic schedule for satisfiability detection.
% 0.18/0.49 % (719810)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2501402585:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.49 % (719809)% WARNING: option uhcvi not known.
% 0.18/0.49 % (719809)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1785350256:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.49 % (719813)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3341024799:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.49 % (719811)dis+10_1_sil=32000:sp=arity:random_seed=2722532531:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.49 % (719808)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1327393846_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.49 % (719814)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2864340168:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49 % TRYING [1]
% 0.18/0.49 % TRYING [2]
% 0.18/0.49 % TRYING [3]
% 0.18/0.49 % (719812)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=463814422:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.49 % TRYING [4]
% 0.18/0.49 % (719810) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-719799-719810"...
% 0.18/0.49 % (719810)...printing done.
% 0.18/0.49 % (719810)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (719810)------------------------------
% 0.18/0.49 % (719810)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (719810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (719810)CaDiCaL version: 2.1.3
% 0.18/0.49 % (719810)Termination reason: Refutation
% 0.18/0.49 % (719810)Time elapsed: 0.016 s
% 0.18/0.49 % (719810)Peak memory usage: 11 MB
% 0.18/0.49 % (719810)Instructions burned: 53 (million)
% 0.18/0.49 % (719799)Success in time 0.042 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------