%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP710+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 : n004.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:38 AM UTC 2026
% Result : Theorem 0.21s 0.56s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 61 ( 41 unt; 2 def)
% Number of atoms : 81 ( 56 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 53 ( 33 ~; 16 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 78 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1,X2] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0] : mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,conjecture,
( ! [X0,X1] :
? [X2] : mult(X0,X2) = X1
& ! [X3,X4] :
? [X5] : mult(X5,X4) = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f7,negated_conjecture,
~ ( ! [X0,X1] :
? [X2] : mult(X0,X2) = X1
& ! [X3,X4] :
? [X5] : mult(X5,X4) = X3 ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
( ? [X0,X1] :
! [X2] : mult(X0,X2) != X1
| ? [X3,X4] :
! [X5] : mult(X5,X4) != X3 ),
inference(ennf_transformation,[],[f7]) ).
fof(f9,plain,
( ! [X2] : sK1 != mult(sK0,X2)
| ! [X5] : sK2 != mult(X5,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X3,sK2),skolemize(X4,sK3)],[f8]) ).
fof(f10,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f12,plain,
! [X2,X0,X1] : mult(X2,mult(X1,mult(X1,X0))) = mult(mult(mult(X2,X1),X1),X0),
inference(cnf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
! [X2,X5] :
( sK1 != mult(sK0,X2)
| sK2 != mult(X5,sK3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,definition,
( spl4_1
<=> ! [X5] : sK2 != mult(X5,sK3) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f18,plain,
( ! [X5] : sK2 != mult(X5,sK3)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f20,definition,
( spl4_2
<=> ! [X2] : sK1 != mult(sK0,X2) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f21,plain,
( ! [X2] : sK1 != mult(sK0,X2)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f22,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f15,f20,f17]) ).
fof(f32,plain,
! [X0,X1] : mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(mult(unit,i(X0)),X1),
inference(superposition,[],[f12,f13]) ).
fof(f35,plain,
! [X0,X1] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
inference(superposition,[],[f12,f14]) ).
fof(f40,plain,
! [X0,X1] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,mult(X1,unit))),
inference(superposition,[],[f10,f12]) ).
fof(f43,plain,
! [X0,X1] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(forward_demodulation,[],[f40,f10]) ).
fof(f46,plain,
! [X0,X1] : mult(X0,X1) = mult(i(X0),mult(X0,mult(X0,X1))),
inference(forward_demodulation,[],[f35,f11]) ).
fof(f49,plain,
! [X0,X1] : mult(i(X0),X1) = mult(X0,mult(i(X0),mult(i(X0),X1))),
inference(forward_demodulation,[],[f32,f11]) ).
fof(f159,plain,
! [X0,X1] : mult(mult(X0,X1),mult(X1,X1)) = mult(mult(X0,mult(X1,X1)),X1),
inference(superposition,[],[f43,f43]) ).
fof(f160,plain,
! [X0] : mult(unit,X0) = mult(i(X0),mult(X0,X0)),
inference(superposition,[],[f43,f14]) ).
fof(f182,plain,
( ! [X0] : sK2 != mult(X0,mult(sK3,sK3))
| ~ spl4_1 ),
inference(superposition,[],[f18,f43]) ).
fof(f183,plain,
! [X0] : mult(i(X0),mult(X0,X0)) = X0,
inference(forward_demodulation,[],[f160,f11]) ).
fof(f187,plain,
( ! [X0,X1] : sK2 != mult(X0,mult(X1,mult(X1,mult(sK3,sK3))))
| ~ spl4_1 ),
inference(superposition,[],[f182,f12]) ).
fof(f386,plain,
( ! [X0] : sK2 != mult(X0,mult(i(sK3),sK3))
| ~ spl4_1 ),
inference(superposition,[],[f187,f183]) ).
fof(f391,plain,
( ! [X0] : mult(X0,unit) != sK2
| ~ spl4_1 ),
inference(forward_demodulation,[],[f386,f14]) ).
fof(f395,plain,
( ! [X0] : sK2 != X0
| ~ spl4_1 ),
inference(forward_demodulation,[],[f391,f10]) ).
fof(f397,plain,
( $false
| ~ spl4_1 ),
inference(equality_resolution,[],[f395]) ).
fof(f398,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f397]) ).
fof(f489,plain,
! [X0] : mult(i(i(X0)),mult(i(X0),X0)) = X0,
inference(superposition,[],[f46,f183]) ).
fof(f501,plain,
! [X0] : mult(i(i(X0)),unit) = X0,
inference(forward_demodulation,[],[f489,f14]) ).
fof(f512,plain,
! [X0] : i(i(X0)) = X0,
inference(forward_demodulation,[],[f501,f10]) ).
fof(f563,plain,
! [X0,X1] : mult(i(X0),X1) = mult(i(X0),mult(X0,mult(i(X0),X1))),
inference(superposition,[],[f46,f49]) ).
fof(f569,plain,
( ! [X0] : sK1 != mult(i(sK0),X0)
| ~ spl4_2 ),
inference(superposition,[],[f21,f49]) ).
fof(f922,plain,
! [X0] : mult(unit,X0) = mult(mult(i(mult(X0,X0)),X0),mult(X0,X0)),
inference(superposition,[],[f159,f14]) ).
fof(f943,plain,
! [X0] : mult(mult(i(mult(X0,X0)),X0),mult(X0,X0)) = X0,
inference(forward_demodulation,[],[f922,f11]) ).
fof(f976,plain,
! [X0] : mult(i(mult(i(mult(X0,X0)),X0)),mult(mult(i(mult(X0,X0)),X0),X0)) = X0,
inference(superposition,[],[f46,f943]) ).
fof(f981,plain,
! [X0] : mult(i(mult(i(mult(X0,X0)),X0)),mult(i(mult(X0,X0)),mult(X0,X0))) = X0,
inference(forward_demodulation,[],[f976,f43]) ).
fof(f988,plain,
! [X0] : mult(i(mult(i(mult(X0,X0)),X0)),unit) = X0,
inference(forward_demodulation,[],[f981,f14]) ).
fof(f990,plain,
! [X0] : i(mult(i(mult(X0,X0)),X0)) = X0,
inference(forward_demodulation,[],[f988,f10]) ).
fof(f1004,plain,
! [X0] : i(X0) = mult(i(mult(X0,X0)),X0),
inference(superposition,[],[f512,f990]) ).
fof(f1025,plain,
! [X0,X1] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(mult(i(X0),X0),X1),
inference(superposition,[],[f12,f1004]) ).
fof(f1031,plain,
! [X0,X1] : mult(unit,X1) = mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))),
inference(forward_demodulation,[],[f1025,f14]) ).
fof(f1040,plain,
! [X0,X1] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
inference(forward_demodulation,[],[f1031,f11]) ).
fof(f1071,plain,
! [X0,X1] : mult(X0,mult(i(X0),X1)) = mult(i(mult(i(X0),i(X0))),mult(i(X0),mult(i(X0),X1))),
inference(superposition,[],[f1040,f563]) ).
fof(f1098,plain,
! [X0,X1] : mult(X0,mult(i(X0),X1)) = X1,
inference(forward_demodulation,[],[f1071,f1040]) ).
fof(f1173,plain,
( ! [X0] : sK1 != X0
| ~ spl4_2 ),
inference(superposition,[],[f569,f1098]) ).
fof(f1197,plain,
( $false
| ~ spl4_2 ),
inference(equality_resolution,[],[f1173]) ).
fof(f1198,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f1197]) ).
cnf(s8,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f22]) ).
cnf(s206,plain,
~ spl4_1,
inference(sat_conversion,[],[f398]) ).
cnf(s422,plain,
~ spl4_2,
inference(sat_conversion,[],[f1198]) ).
cnf(s423,plain,
$false,
inference(rat,[],[s8,s422,s206]) ).
fof(f1199,plain,
$false,
inference(avatar_sat_refutation,[],[s423]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP710+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.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 10:36:51 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.21/0.56 % (3322105)Will run a generic schedule for satisfiability detection.
% 0.21/0.56 % (3322111)% WARNING: option uhcvi not known.
% 0.21/0.56 % (3322111)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2248262028:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.56 % (3322114)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1075446744:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.56 % (3322110)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1066646312_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.56 % (3322112)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2004456700:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.56 % (3322113)dis+10_1_sil=32000:sp=arity:random_seed=3787935633:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.56 % (3322116)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1398559827:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.56 % (3322115)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2486305775:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.56 % TRYING [1]
% 0.21/0.56 % TRYING [2]
% 0.21/0.56 % TRYING [3]
% 0.21/0.56 % TRYING [4]
% 0.21/0.56 % TRYING [5]
% 0.21/0.56 % TRYING [6]
% 0.21/0.56 % (3322112) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3322105-3322112"...
% 0.21/0.56 % (3322112)...printing done.
% 0.21/0.56 % (3322112)Refutation found. Thanks to Tanya!
% 0.21/0.56 % SZS status Theorem for theBenchmark
% 0.21/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.56 % (3322112)------------------------------
% 0.21/0.56 % (3322112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.56 % (3322112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.56 % (3322112)CaDiCaL version: 2.1.3
% 0.21/0.56 % (3322112)Termination reason: Refutation
% 0.21/0.56 % (3322112)Time elapsed: 0.055 s
% 0.21/0.56 % (3322112)Peak memory usage: 13 MB
% 0.21/0.56 % (3322112)Instructions burned: 52 (million)
% 0.21/0.56 % (3322105)Success in time 0.113 s
% 0.21/0.56 % Vampire exiting
%------------------------------------------------------------------------------