%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP115-1 : TPTP v9.3.1. Released v1.2.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:16:41 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(X0,multiply(multiply(X0,multiply(multiply(X0,X1),X2)),multiply(identity,multiply(X2,X2)))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(a,multiply(a,a)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_order3) ).
fof(f3,plain,
identity != multiply(a,multiply(a,a)),
inference(reorient_equations,[],[f2]) ).
fof(f6,plain,
! [X2,X0,X1] : multiply(multiply(X1,X0),X2) = multiply(X1,multiply(X0,multiply(identity,multiply(multiply(identity,multiply(X2,X2)),multiply(identity,multiply(X2,X2)))))),
inference(superposition,[],[f1,f1]) ).
fof(f7,plain,
! [X2,X0,X1] : multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),multiply(identity,multiply(multiply(identity,X0),multiply(identity,X0))))),X0)) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f13,plain,
! [X2,X0,X1] : multiply(multiply(X1,X0),multiply(identity,X2)) = multiply(X1,multiply(X0,X2)),
inference(superposition,[],[f7,f1]) ).
fof(f23,plain,
! [X2,X0,X1] : multiply(multiply(X1,multiply(X1,multiply(multiply(X1,X0),multiply(identity,multiply(X2,X2))))),X2) = X0,
inference(superposition,[],[f6,f1]) ).
fof(f25,plain,
! [X2,X0,X1] : multiply(X0,multiply(multiply(multiply(X0,multiply(X0,X1)),X2),multiply(X2,X2))) = X1,
inference(superposition,[],[f7,f6]) ).
fof(f63,plain,
! [X2,X0,X1] : multiply(X0,multiply(X1,multiply(identity,multiply(multiply(identity,multiply(X2,X2)),multiply(identity,multiply(X2,X2)))))) = multiply(multiply(multiply(X0,X1),identity),X2),
inference(superposition,[],[f6,f13]) ).
fof(f72,plain,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(multiply(multiply(X0,X1),identity),X2),
inference(forward_demodulation,[],[f63,f6]) ).
fof(f196,plain,
! [X3,X0] : multiply(X0,X3) = multiply(multiply(X0,identity),X3),
inference(superposition,[],[f72,f1]) ).
fof(f505,plain,
! [X0,X1] : multiply(X0,multiply(multiply(X0,multiply(X0,X1)),multiply(identity,identity))) = X1,
inference(superposition,[],[f25,f13]) ).
fof(f545,plain,
! [X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,X1),identity))) = X1,
inference(forward_demodulation,[],[f505,f13]) ).
fof(f589,plain,
! [X0] : identity = multiply(X0,multiply(X0,multiply(X0,identity))),
inference(superposition,[],[f545,f196]) ).
fof(f642,plain,
! [X2,X0,X1] : multiply(multiply(X1,multiply(X1,multiply(X1,multiply(X0,multiply(X2,X2))))),X2) = X0,
inference(forward_demodulation,[],[f23,f13]) ).
fof(f699,plain,
! [X2,X0,X1] : multiply(X0,identity) = multiply(multiply(X2,multiply(X2,multiply(X2,multiply(X0,multiply(X1,X1))))),X1),
inference(superposition,[],[f642,f196]) ).
fof(f755,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f699,f642]) ).
fof(f777,plain,
! [X0] : identity = multiply(X0,multiply(X0,X0)),
inference(superposition,[],[f589,f755]) ).
fof(f876,plain,
identity != identity,
inference(superposition,[],[f3,f777]) ).
fof(f877,plain,
$false,
inference(trivial_inequality_removal,[],[f876]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP115-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 09:22:45 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/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.48 % (1390735)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (1390749)dis+10_1_sil=32000:sp=arity:random_seed=4238570415:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (1390747)% WARNING: option uhcvi not known.
% 0.17/0.48 % (1390748)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1677607307:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (1390746)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=476725818_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % (1390747)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3487358904:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (1390751)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1352748765:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (1390752)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2251566966:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % (1390750)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=995178793:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % TRYING [1]
% 0.17/0.48 % TRYING [2]
% 0.17/0.48 % TRYING [3]
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (1390749) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1390735-1390749"...
% 0.17/0.48 % (1390749)...printing done.
% 0.17/0.48 % (1390749)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (1390749)------------------------------
% 0.17/0.48 % (1390749)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (1390749)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (1390749)CaDiCaL version: 2.1.3
% 0.17/0.48 % (1390749)Termination reason: Refutation
% 0.17/0.48 % (1390749)Time elapsed: 0.014 s
% 0.17/0.48 % (1390749)Peak memory usage: 12 MB
% 0.17/0.48 % (1390749)Instructions burned: 45 (million)
% 0.17/0.48 % (1390735)Success in time 0.05 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------