%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP703+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 : n013.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:36 AM UTC 2026
% Result : Theorem 0.12s 0.49s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 25 unt; 3 def)
% Number of atoms : 70 ( 41 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 48 ( 22 ~; 19 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f8,axiom,
! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f9,axiom,
! [X0,X1] : mult(X1,mult(X0,op_c)) = mult(mult(X1,X0),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f10,axiom,
! [X0,X1] : mult(X1,mult(op_c,X0)) = mult(mult(X1,op_c),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
fof(f12,axiom,
! [X0,X1] : op_e = mult(mult(rd(op_c,mult(X1,X0)),X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f12) ).
fof(f14,conjecture,
! [X0,X1] :
( mult(op_e,mult(X0,X1)) = mult(mult(op_e,X0),X1)
& mult(X0,mult(X1,op_e)) = mult(mult(X0,X1),op_e)
& mult(X0,mult(op_e,X1)) = mult(mult(X0,op_e),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( mult(op_e,mult(X0,X1)) = mult(mult(op_e,X0),X1)
& mult(X0,mult(X1,op_e)) = mult(mult(X0,X1),op_e)
& mult(X0,mult(op_e,X1)) = mult(mult(X0,op_e),X1) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0,X1] :
( mult(op_e,mult(X0,X1)) != mult(mult(op_e,X0),X1)
| mult(X0,mult(X1,op_e)) != mult(mult(X0,X1),op_e)
| mult(X0,mult(op_e,X1)) != mult(mult(X0,op_e),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( mult(op_e,mult(sK0,sK1)) != mult(mult(op_e,sK0),sK1)
| mult(sK0,mult(sK1,op_e)) != mult(mult(sK0,sK1),op_e)
| mult(sK0,mult(op_e,sK1)) != mult(mult(sK0,op_e),sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).
fof(f20,plain,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
fof(f23,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
! [X0,X1] : mult(X1,mult(X0,op_c)) = mult(mult(X1,X0),op_c),
inference(cnf_transformation,[],[f9]) ).
fof(f27,plain,
! [X0,X1] : mult(X1,mult(op_c,X0)) = mult(mult(X1,op_c),X0),
inference(cnf_transformation,[],[f10]) ).
fof(f29,plain,
! [X0,X1] : op_e = mult(mult(rd(op_c,mult(X1,X0)),X0),X1),
inference(cnf_transformation,[],[f12]) ).
fof(f31,plain,
( mult(op_e,mult(sK0,sK1)) != mult(mult(op_e,sK0),sK1)
| mult(sK0,mult(sK1,op_e)) != mult(mult(sK0,sK1),op_e)
| mult(sK0,mult(op_e,sK1)) != mult(mult(sK0,op_e),sK1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f33,definition,
( spl2_1
<=> mult(sK0,mult(op_e,sK1)) = mult(mult(sK0,op_e),sK1) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f35,plain,
( mult(sK0,mult(op_e,sK1)) != mult(mult(sK0,op_e),sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f37,definition,
( spl2_2
<=> mult(sK0,mult(sK1,op_e)) = mult(mult(sK0,sK1),op_e) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f39,plain,
( mult(sK0,mult(sK1,op_e)) != mult(mult(sK0,sK1),op_e)
| spl2_2 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f41,definition,
( spl2_3
<=> mult(op_e,mult(sK0,sK1)) = mult(mult(op_e,sK0),sK1) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f43,plain,
( mult(op_e,mult(sK0,sK1)) != mult(mult(op_e,sK0),sK1)
| spl2_3 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f44,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f31,f41,f37,f33]) ).
fof(f126,plain,
! [X0] : op_e = mult(rd(op_c,mult(unit,X0)),X0),
inference(superposition,[],[f22,f29]) ).
fof(f128,plain,
! [X0] : op_e = mult(rd(op_c,X0),X0),
inference(forward_demodulation,[],[f126,f23]) ).
fof(f134,plain,
op_c = op_e,
inference(forward_demodulation,[],[f128,f20]) ).
fof(f139,plain,
( mult(sK0,mult(op_c,sK1)) != mult(mult(sK0,op_c),sK1)
| spl2_1 ),
inference(superposition,[],[f35,f134]) ).
fof(f140,plain,
( $false
| spl2_1 ),
inference(forward_subsumption_resolution,[],[f139,f27]) ).
fof(f141,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f143,plain,
( mult(sK0,mult(sK1,op_c)) != mult(mult(sK0,sK1),op_c)
| spl2_2 ),
inference(forward_demodulation,[],[f39,f134]) ).
fof(f144,plain,
( $false
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f143,f26]) ).
fof(f145,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f144]) ).
fof(f147,plain,
( mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1)
| spl2_3 ),
inference(forward_demodulation,[],[f43,f134]) ).
fof(f148,plain,
( $false
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f147,f25]) ).
fof(f149,plain,
spl2_3,
inference(avatar_contradiction_clause,[],[f148]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f44]) ).
cnf(s2,plain,
spl2_1,
inference(sat_conversion,[],[f141]) ).
cnf(s3,plain,
spl2_2,
inference(sat_conversion,[],[f145]) ).
cnf(s4,plain,
spl2_3,
inference(sat_conversion,[],[f149]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s4,s3,s2]) ).
fof(f150,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP703+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n013.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 10:36:07 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.12/0.49 % (27939)Will run a generic schedule for satisfiability detection.
% 0.12/0.49 % (27944)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1363143435_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.49 % TRYING [1]
% 0.12/0.49 % TRYING [2]
% 0.12/0.49 % TRYING [3]
% 0.12/0.49 % TRYING [4]
% 0.12/0.49 % TRYING [5]
% 0.12/0.49 % (27947)dis+10_1_sil=32000:sp=arity:random_seed=2677287689:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.49 % (27948)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3017990408:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.49 % (27946)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3709118468:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.49 % (27950)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3256302601:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.49 % (27949)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=123230428:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.49 % (27947) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-27939-27947"...
% 0.12/0.49 % (27945)% WARNING: option uhcvi not known.
% 0.12/0.49 % (27948) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-27939-27948"...
% 0.12/0.49 % (27947)...printing done.
% 0.12/0.49 % (27947)Refutation found. Thanks to Tanya!
% 0.12/0.49 % SZS status Theorem for theBenchmark
% 0.12/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.49 % (27947)------------------------------
% 0.12/0.49 % (27947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.49 % (27947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.49 % (27947)CaDiCaL version: 2.1.3
% 0.12/0.49 % (27947)Termination reason: Refutation
% 0.12/0.49 % (27947)Time elapsed: 0.007 s
% 0.12/0.49 % (27947)Peak memory usage: 12 MB
% 0.12/0.49 % (27947)Instructions burned: 6 (million)
% 0.12/0.49 % (27939)Success in time 0.043 s
% 0.12/0.49 % Vampire exiting
%------------------------------------------------------------------------------