%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP656-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:26 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% 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 : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 25 ( 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),mult(X2,X0)) = mult(mult(X0,mult(X1,X2)),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f6,negated_conjecture,
! [X0] : tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
fof(f13,plain,
! [X2,X0,X1] : mult(mult(X1,X2),mult(ld(X2,X0),X1)) = mult(mult(X1,X0),X1),
inference(superposition,[],[f5,f1]) ).
fof(f31,plain,
! [X2,X0,X1] : mult(ld(X2,X1),X0) = ld(mult(X0,X2),mult(mult(X0,X1),X0)),
inference(superposition,[],[f2,f13]) ).
fof(f151,plain,
! [X0,X1] : mult(ld(X1,X1),X0) = X0,
inference(superposition,[],[f31,f2]) ).
fof(f165,plain,
! [X0,X1] : ld(X1,X1) = rd(X0,X0),
inference(superposition,[],[f4,f151]) ).
fof(f182,plain,
! [X0] : tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))) != tuple(x1(ld(X0,X0)),mult(x1_2(ld(X0,X0)),ld(X0,X0))),
inference(superposition,[],[f6,f151]) ).
fof(f213,plain,
! [X0,X1] : mult(X1,rd(X0,X0)) = X1,
inference(superposition,[],[f1,f165]) ).
fof(f215,plain,
! [X0] : tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))) != tuple(x1(rd(X0,X0)),mult(x1_2(rd(X0,X0)),rd(X0,X0))),
inference(superposition,[],[f182,f165]) ).
fof(f323,plain,
! [X0] : tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))) != tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))),
inference(superposition,[],[f215,f213]) ).
fof(f325,plain,
$false,
inference(trivial_inequality_removal,[],[f323]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP656-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n008.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 10:33:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.46 % (1027547)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (1027554)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2991134859:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46 % (1027553)% WARNING: option uhcvi not known.
% 0.10/0.46 % (1027554) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1027547-1027554"...
% 0.10/0.46 % (1027552)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1570402066_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46 % (1027553)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2422381552:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % (1027555)dis+10_1_sil=32000:sp=arity:random_seed=3716521748:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46 % (1027556)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2548787190:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (1027554)...printing done.
% 0.10/0.46 % (1027558)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2523824806:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46 % (1027557)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=505265920:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46 % TRYING [1]
% 0.10/0.46 % TRYING [2]
% 0.10/0.46 % TRYING [3]
% 0.10/0.46 % (1027554)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (1027554)------------------------------
% 0.10/0.46 % (1027554)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (1027554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (1027554)CaDiCaL version: 2.1.3
% 0.10/0.46 % (1027554)Termination reason: Refutation
% 0.10/0.46 % (1027554)Time elapsed: 0.007 s
% 0.10/0.46 % (1027554)Peak memory usage: 11 MB
% 0.10/0.46 % (1027554)Instructions burned: 17 (million)
% 0.10/0.46 % (1027547)Success in time 0.035 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------