%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP679-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:32 AM UTC 2026
% Result : Unsatisfiable 0.46s 0.53s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 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 : 5 ( 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 : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X0,X2))) = mult(mult(X0,mult(X1,X0)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
fof(f8,axiom,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
fof(f9,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f31,plain,
! [X0] : ld(op_c,mult(X0,op_c)) = X0,
inference(superposition,[],[f2,f8]) ).
fof(f101,plain,
! [X0,X1] : mult(op_c,mult(X0,mult(op_c,X1))) = mult(mult(op_c,mult(op_c,X0)),X1),
inference(superposition,[],[f7,f8]) ).
fof(f104,plain,
! [X0,X1] : mult(X0,mult(unit,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[],[f7,f6]) ).
fof(f122,plain,
! [X0,X1] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(forward_demodulation,[],[f104,f6]) ).
fof(f135,plain,
mult(a,mult(op_c,op_c)) != mult(op_c,mult(op_c,a)),
inference(superposition,[],[f9,f122]) ).
fof(f957,plain,
! [X0] : mult(op_c,mult(op_c,X0)) = ld(op_c,mult(op_c,mult(X0,mult(op_c,op_c)))),
inference(superposition,[],[f31,f101]) ).
fof(f969,plain,
! [X0] : mult(op_c,mult(op_c,X0)) = mult(X0,mult(op_c,op_c)),
inference(forward_demodulation,[],[f957,f2]) ).
fof(f1083,plain,
mult(op_c,mult(op_c,a)) != mult(op_c,mult(op_c,a)),
inference(superposition,[],[f135,f969]) ).
fof(f1084,plain,
$false,
inference(trivial_inequality_removal,[],[f1083]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP679-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 % Computer : n001.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 10:41:00 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/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.46/0.53 % (3368652)Will run a generic schedule for satisfiability detection.
% 0.46/0.53 % (3368676)% WARNING: option uhcvi not known.
% 0.46/0.53 % (3368679)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1144885716:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.46/0.53 % (3368677)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1963998614:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.46/0.53 % (3368676)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1325174291:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.46/0.53 % (3368678)dis+10_1_sil=32000:sp=arity:random_seed=2009862390:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.46/0.53 % (3368675)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2652972667_2999 on theBenchmark for (2999ds/0Mi)
% 0.46/0.53 % TRYING [1]
% 0.46/0.53 % TRYING [2]
% 0.46/0.53 % TRYING [3]
% 0.46/0.53 % (3368680)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1830872412:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.46/0.53 % TRYING [4]
% 0.46/0.53 % (3368681)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2065030133:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.46/0.53 % TRYING [5]
% 0.46/0.53 % (3368677) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3368652-3368677"...
% 0.46/0.53 % (3368677)...printing done.
% 0.46/0.53 % (3368677)Refutation found. Thanks to Tanya!
% 0.46/0.53 % SZS status Unsatisfiable for theBenchmark
% 0.46/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.46/0.53 % (3368677)------------------------------
% 0.46/0.53 % (3368677)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.46/0.53 % (3368677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.46/0.53 % (3368677)CaDiCaL version: 2.1.3
% 0.46/0.53 % (3368677)Termination reason: Refutation
% 0.46/0.53 % (3368677)Time elapsed: 0.043 s
% 0.46/0.53 % (3368677)Peak memory usage: 11 MB
% 0.46/0.53 % (3368677)Instructions burned: 48 (million)
% 0.46/0.53 % (3368652)Success in time 0.099 s
% 0.46/0.53 % Vampire exiting
%------------------------------------------------------------------------------