%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP748+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 : n005.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:42 AM UTC 2026
% Result : Theorem 1.06s 0.58s
% Output : Refutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 32 unt; 0 def)
% Number of atoms : 64 ( 63 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 12 ~; 14 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 101 ( 89 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f7,axiom,
! [X0,X1,X2] : mult(mult(mult(X2,X1),X0),X1) = mult(X2,mult(mult(X1,X0),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
fof(f8,axiom,
! [X0,X1] : mult(mult(X1,X0),i(X0)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f9,axiom,
! [X0] : mult(X0,i(X0)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f10,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
fof(f11,axiom,
! [X0,X1] :
( mult(X1,X0) = mult(X0,X1)
| mult(i(X1),mult(X1,X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
fof(f12,conjecture,
( ! [X0,X1,X2] : mult(X2,mult(X0,mult(X2,X1))) = mult(mult(mult(X2,X0),X2),X1)
| ! [X3,X4,X5] : mult(X3,mult(X5,mult(X4,X5))) = mult(mult(mult(X3,X5),X4),X5)
| ! [X6,X7,X8] : mult(mult(X8,X6),mult(X7,X8)) = mult(mult(X8,mult(X6,X7)),X8)
| ! [X9,X10,X11] : mult(mult(X11,X9),mult(X10,X11)) = mult(X11,mult(mult(X9,X10),X11)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f13,negated_conjecture,
~ ( ! [X0,X1,X2] : mult(X2,mult(X0,mult(X2,X1))) = mult(mult(mult(X2,X0),X2),X1)
| ! [X3,X4,X5] : mult(X3,mult(X5,mult(X4,X5))) = mult(mult(mult(X3,X5),X4),X5)
| ! [X6,X7,X8] : mult(mult(X8,X6),mult(X7,X8)) = mult(mult(X8,mult(X6,X7)),X8)
| ! [X9,X10,X11] : mult(mult(X11,X9),mult(X10,X11)) = mult(X11,mult(mult(X9,X10),X11)) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
( ? [X0,X1,X2] : mult(X2,mult(X0,mult(X2,X1))) != mult(mult(mult(X2,X0),X2),X1)
& ? [X3,X4,X5] : mult(X3,mult(X5,mult(X4,X5))) != mult(mult(mult(X3,X5),X4),X5)
& ? [X6,X7,X8] : mult(mult(X8,X6),mult(X7,X8)) != mult(mult(X8,mult(X6,X7)),X8)
& ? [X9,X10,X11] : mult(mult(X11,X9),mult(X10,X11)) != mult(X11,mult(mult(X9,X10),X11)) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
( mult(sK2,mult(sK0,mult(sK2,sK1))) != mult(mult(mult(sK2,sK0),sK2),sK1)
& mult(sK3,mult(sK5,mult(sK4,sK5))) != mult(mult(mult(sK3,sK5),sK4),sK5)
& mult(mult(sK8,sK6),mult(sK7,sK8)) != mult(mult(sK8,mult(sK6,sK7)),sK8)
& mult(mult(sK11,sK9),mult(sK10,sK11)) != mult(sK11,mult(mult(sK9,sK10),sK11)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7),skolemize(X8,sK8),skolemize(X9,sK9),skolemize(X10,sK10),skolemize(X11,sK11)],[f14]) ).
fof(f16,plain,
! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f17,plain,
! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
inference(cnf_transformation,[],[f2]) ).
fof(f18,plain,
! [X0,X1] : mult(rd(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1] : rd(mult(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f22,plain,
! [X2,X0,X1] : mult(mult(mult(X2,X1),X0),X1) = mult(X2,mult(mult(X1,X0),X1)),
inference(cnf_transformation,[],[f7]) ).
fof(f23,plain,
! [X0,X1] : mult(mult(X1,X0),i(X0)) = X1,
inference(cnf_transformation,[],[f8]) ).
fof(f24,plain,
! [X0] : unit = mult(X0,i(X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f25,plain,
! [X0] : unit = mult(i(X0),X0),
inference(cnf_transformation,[],[f10]) ).
fof(f26,plain,
! [X0,X1] :
( mult(i(X1),mult(X1,X0)) = X0
| mult(X1,X0) = mult(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f29,plain,
mult(sK3,mult(sK5,mult(sK4,sK5))) != mult(mult(mult(sK3,sK5),sK4),sK5),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
mult(sK3,mult(sK5,mult(sK4,sK5))) != mult(sK3,mult(mult(sK5,sK4),sK5)),
inference(backward_demodulation,[],[f29,f22]) ).
fof(f42,plain,
! [X0] : i(X0) = ld(X0,unit),
inference(superposition,[],[f17,f24]) ).
fof(f44,plain,
! [X0] : ld(i(X0),unit) = X0,
inference(superposition,[],[f17,f25]) ).
fof(f47,plain,
! [X0] : i(i(X0)) = X0,
inference(backward_demodulation,[],[f44,f42]) ).
fof(f68,plain,
! [X0,X1] : rd(X0,X1) = mult(X0,i(X1)),
inference(superposition,[],[f23,f18]) ).
fof(f90,plain,
! [X0,X1] : mult(i(X0),mult(mult(X0,X1),X0)) = mult(mult(unit,X1),X0),
inference(superposition,[],[f22,f25]) ).
fof(f101,plain,
! [X0,X1] : mult(X1,X0) = mult(i(X0),mult(mult(X0,X1),X0)),
inference(forward_demodulation,[],[f90,f21]) ).
fof(f115,plain,
! [X0,X1] :
( mult(ld(X1,X0),X1) = X0
| ld(X1,X0) = mult(i(X1),X0) ),
inference(superposition,[],[f26,f16]) ).
fof(f123,plain,
! [X0,X1] :
( mult(X1,X0) = ld(i(X1),X0)
| mult(X1,X0) = mult(X0,X1) ),
inference(superposition,[],[f17,f26]) ).
fof(f288,plain,
! [X0,X1] : mult(mult(X1,X0),X1) = ld(i(X1),mult(X0,X1)),
inference(superposition,[],[f17,f101]) ).
fof(f820,plain,
! [X0,X1] :
( ld(X1,X0) = rd(X0,X1)
| ld(X1,X0) = mult(i(X1),X0) ),
inference(superposition,[],[f19,f115]) ).
fof(f1064,plain,
! [X0,X1] :
( ld(X0,X1) = mult(i(X0),X1)
| mult(X1,i(X0)) = mult(i(X0),X1) ),
inference(superposition,[],[f123,f47]) ).
fof(f1097,plain,
! [X0,X1] :
( rd(X1,X0) = mult(i(X0),X1)
| ld(X0,X1) = mult(i(X0),X1) ),
inference(forward_demodulation,[],[f1064,f68]) ).
fof(f1104,plain,
! [X0,X1] :
( ld(X0,X1) = mult(i(X0),X1)
| ld(X0,X1) = mult(i(X0),X1) ),
inference(forward_subsumption_demodulation,[],[f1097,f820]) ).
fof(f1105,plain,
! [X0,X1] : ld(X0,X1) = mult(i(X0),X1),
inference(duplicate_literal_removal,[],[f1104]) ).
fof(f1144,plain,
! [X0,X1] : mult(X0,X1) = ld(i(X0),X1),
inference(superposition,[],[f1105,f47]) ).
fof(f1199,plain,
! [X0,X1] : mult(mult(X1,X0),X1) = mult(X1,mult(X0,X1)),
inference(backward_demodulation,[],[f288,f1144]) ).
fof(f1266,plain,
mult(sK3,mult(sK5,mult(sK4,sK5))) != mult(sK3,mult(sK5,mult(sK4,sK5))),
inference(backward_demodulation,[],[f31,f1199]) ).
fof(f1268,plain,
$false,
inference(trivial_inequality_removal,[],[f1266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP748+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.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 10:41:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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
% 1.06/0.58 % (3803898)Will run a generic schedule for satisfiability detection.
% 1.06/0.58 % (3803908)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=345622628:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.06/0.58 % (3803904)% WARNING: option uhcvi not known.
% 1.06/0.58 % (3803903)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2446521306_2999 on theBenchmark for (2999ds/0Mi)
% 1.06/0.58 % (3803909)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=64059801:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.06/0.58 % (3803905)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3965775441:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.06/0.58 % (3803906)dis+10_1_sil=32000:sp=arity:random_seed=4128882474:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.06/0.58 % (3803907)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1914834217:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.06/0.58 % TRYING [1]
% 1.06/0.58 % TRYING [2]
% 1.06/0.58 % (3803904)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1318956592:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.06/0.58 % TRYING [3]
% 1.06/0.58 % TRYING [4]
% 1.06/0.58 % TRYING [5]
% 1.06/0.58 % (3803908)Instruction limit reached!
% 1.06/0.58 % (3803908)------------------------------
% 1.06/0.58 % (3803908)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.06/0.58 % (3803908)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.06/0.58 % (3803908)CaDiCaL version: 2.1.3
% 1.06/0.58 % (3803908)Termination reason: Instruction limit
% 1.06/0.58 % (3803908)Termination phase: Saturation
% 1.06/0.58 % (3803908)Time elapsed: 0.043 s
% 1.06/0.58 % (3803908)Peak memory usage: 12 MB
% 1.06/0.58 % (3803908)Instructions burned: 132 (million)
% 1.06/0.58 % (3803917)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1640074476:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.06/0.58 % TRYING [6]
% 1.06/0.58 % TRYING [1]
% 1.06/0.58 % (3803906)Instruction limit reached!
% 1.06/0.58 % (3803906)------------------------------
% 1.06/0.58 % (3803906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.06/0.58 % (3803906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.06/0.58 % (3803906)CaDiCaL version: 2.1.3
% 1.06/0.58 % (3803906)Termination reason: Instruction limit
% 1.06/0.58 % (3803906)Termination phase: Saturation
% 1.06/0.58 % (3803906)Time elapsed: 0.058 s
% 1.06/0.58 % (3803906)Peak memory usage: 12 MB
% 1.06/0.58 % (3803906)Instructions burned: 104 (million)
% 1.06/0.58 % TRYING [2]
% 1.06/0.58 % TRYING [3]
% 1.06/0.58 % TRYING [4]
% 1.06/0.58 % (3803907)Instruction limit reached!
% 1.06/0.58 % (3803907)------------------------------
% 1.06/0.58 % (3803907)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.06/0.58 % (3803907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.06/0.58 % (3803907)CaDiCaL version: 2.1.3
% 1.06/0.58 % (3803907)Termination reason: Instruction limit
% 1.06/0.58 % (3803907)Termination phase: Saturation
% 1.06/0.58 % (3803907)Time elapsed: 0.070 s
% 1.06/0.58 % (3803907)Peak memory usage: 12 MB
% 1.06/0.58 % (3803907)Instructions burned: 116 (million)
% 1.06/0.58 % (3803919)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2225160656:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.06/0.58 % TRYING [5]
% 1.06/0.58 % (3803920)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1228151372:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.06/0.58 % (3803909)Instruction limit reached!
% 1.06/0.58 % (3803909)------------------------------
% 1.06/0.58 % (3803909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.06/0.58 % (3803909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.06/0.58 % (3803909)CaDiCaL version: 2.1.3
% 1.06/0.58 % (3803909)Termination reason: Instruction limit
% 1.06/0.58 % (3803909)Termination phase: Saturation
% 1.06/0.58 % (3803909)Time elapsed: 0.099 s
% 1.06/0.58 % (3803909)Peak memory usage: 13 MB
% 1.06/0.58 % (3803909)Instructions burned: 160 (million)
% 1.06/0.58 % (3803923)ott-21_1_sil=16000:fs=off:random_seed=1720190235:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.06/0.58 % TRYING [6]
% 1.06/0.58 % (3803919) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3803898-3803919"...
% 1.06/0.58 % (3803919)...printing done.
% 1.06/0.58 % (3803919)Refutation found. Thanks to Tanya!
% 1.06/0.58 % SZS status Theorem for theBenchmark
% 1.06/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.06/0.58 % (3803919)------------------------------
% 1.06/0.58 % (3803919)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.06/0.58 % (3803919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.06/0.58 % (3803919)CaDiCaL version: 2.1.3
% 1.06/0.58 % (3803919)Termination reason: Refutation
% 1.06/0.58 % (3803919)Time elapsed: 0.057 s
% 1.06/0.58 % (3803919)Peak memory usage: 12 MB
% 1.06/0.58 % (3803919)Instructions burned: 89 (million)
% 1.06/0.58 % (3803898)Success in time 0.17 s
% 1.06/0.58 % Vampire exiting
%------------------------------------------------------------------------------