%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP522-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 : n015.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:01 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 34 unt; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 62 ( 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
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,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f5,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f4]) ).
fof(f29,plain,
! [X2,X0,X1] : inverse(divide(X1,divide(X0,divide(divide(X2,X2),X1)))) = X0,
inference(superposition,[],[f3,f1]) ).
fof(f34,plain,
! [X0,X1] : inverse(divide(X1,divide(X0,inverse(X1)))) = X0,
inference(forward_demodulation,[],[f29,f3]) ).
fof(f42,plain,
! [X0,X1] : divide(X1,X1) = inverse(divide(X0,inverse(inverse(X0)))),
inference(superposition,[],[f34,f3]) ).
fof(f57,plain,
! [X0,X1] : divide(X1,X1) = divide(X0,X0),
inference(superposition,[],[f42,f42]) ).
fof(f68,plain,
! [X0,X1] : divide(X1,X1) = inverse(divide(X0,X0)),
inference(superposition,[],[f57,f3]) ).
fof(f86,plain,
! [X0,X1] : inverse(X1) = inverse(divide(X1,divide(X0,X0))),
inference(superposition,[],[f34,f57]) ).
fof(f130,plain,
! [X2,X0,X1] : inverse(divide(divide(X1,X1),divide(X2,divide(X0,X0)))) = X2,
inference(superposition,[],[f34,f68]) ).
fof(f131,plain,
! [X2,X0] : inverse(inverse(divide(X2,divide(X0,X0)))) = X2,
inference(forward_demodulation,[],[f130,f3]) ).
fof(f237,plain,
! [X2] : inverse(inverse(X2)) = X2,
inference(forward_demodulation,[],[f131,f86]) ).
fof(f238,plain,
! [X0,X1] : inverse(X0) = divide(X1,divide(X0,inverse(X1))),
inference(superposition,[],[f237,f34]) ).
fof(f239,plain,
! [X0,X1] : inverse(inverse(X0)) = divide(X0,divide(X1,X1)),
inference(superposition,[],[f237,f86]) ).
fof(f252,plain,
! [X0,X1] : divide(X0,divide(X1,X1)) = X0,
inference(forward_demodulation,[],[f239,f237]) ).
fof(f270,plain,
! [X0,X1] : divide(X1,divide(X1,X0)) = X0,
inference(superposition,[],[f1,f252]) ).
fof(f284,plain,
! [X2,X0,X1] : divide(X0,divide(divide(X1,X1),divide(X2,X0))) = X2,
inference(superposition,[],[f1,f252]) ).
fof(f289,plain,
! [X2,X0] : divide(X0,inverse(divide(X2,X0))) = X2,
inference(forward_demodulation,[],[f284,f3]) ).
fof(f416,plain,
! [X0,X1] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[],[f270,f289]) ).
fof(f1434,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f2,f3]) ).
fof(f1437,plain,
! [X2,X0,X1] : divide(X1,divide(X0,X0)) = multiply(X1,divide(X2,X2)),
inference(superposition,[],[f1434,f68]) ).
fof(f1439,plain,
! [X2,X0,X1] : divide(X1,X0) = multiply(X1,divide(X2,divide(X0,inverse(X2)))),
inference(superposition,[],[f1434,f34]) ).
fof(f1446,plain,
! [X0,X1] : multiply(X1,divide(X0,X1)) = X0,
inference(superposition,[],[f1434,f289]) ).
fof(f1464,plain,
! [X0,X1] : inverse(divide(X1,multiply(X0,X1))) = X0,
inference(superposition,[],[f34,f1434]) ).
fof(f1528,plain,
! [X0,X1] : divide(multiply(X0,X1),X1) = X0,
inference(forward_demodulation,[],[f1464,f416]) ).
fof(f1543,plain,
! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
inference(forward_demodulation,[],[f1439,f238]) ).
fof(f1544,plain,
! [X2,X1] : multiply(X1,divide(X2,X2)) = X1,
inference(forward_demodulation,[],[f1437,f252]) ).
fof(f1657,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f1446,f1528]) ).
fof(f1777,plain,
a2 != multiply(multiply(b2,inverse(b2)),a2),
inference(superposition,[],[f5,f1657]) ).
fof(f1778,plain,
a2 != multiply(a2,multiply(b2,inverse(b2))),
inference(forward_demodulation,[],[f1777,f1657]) ).
fof(f1802,plain,
a2 != multiply(a2,divide(b2,b2)),
inference(superposition,[],[f1778,f1543]) ).
fof(f1803,plain,
$false,
inference(forward_subsumption_resolution,[],[f1802,f1544]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP522-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n015.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 10:10:15 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 Running first-order model finding
% 0.11/0.39 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.11/0.45 % (1430050)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1430064)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=999250097:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (1430063)% WARNING: option uhcvi not known.
% 0.11/0.45 % (1430063)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1900608442:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (1430062)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4171524667_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (1430067)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1176763453:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (1430065)dis+10_1_sil=32000:sp=arity:random_seed=3406975248:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (1430068)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2557110961:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % (1430066)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2506119319:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (1430064) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1430050-1430064"...
% 0.11/0.45 % (1430064)...printing done.
% 0.11/0.45 % (1430064)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1430064)------------------------------
% 0.11/0.45 % (1430064)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1430064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1430064)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1430064)Termination reason: Refutation
% 0.11/0.45 % (1430064)Time elapsed: 0.016 s
% 0.11/0.45 % (1430064)Peak memory usage: 11 MB
% 0.11/0.45 % (1430064)Instructions burned: 53 (million)
% 0.11/0.45 % (1430050)Success in time 0.051 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------