%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP157-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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:16:59 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 11 unt; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 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 : 5 ( 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
fof(f17,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono2a_1) ).
fof(f18,plain,
b = least_upper_bound(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_mono2a) ).
fof(f20,plain,
multiply(c,b) != least_upper_bound(multiply(c,a),multiply(c,b)),
inference(reorient_equations,[],[f19]) ).
fof(f25,plain,
multiply(c,b) != least_upper_bound(multiply(c,b),multiply(c,a)),
inference(superposition,[],[f20,f6]) ).
fof(f26,plain,
b = least_upper_bound(b,a),
inference(superposition,[],[f18,f6]) ).
fof(f27,plain,
multiply(c,b) != multiply(c,least_upper_bound(b,a)),
inference(forward_demodulation,[],[f25,f13]) ).
fof(f29,plain,
multiply(c,b) != multiply(c,b),
inference(forward_demodulation,[],[f27,f26]) ).
fof(f30,plain,
$false,
inference(trivial_inequality_removal,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP157-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n008.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 09:34:54 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.17/0.47 % (972781)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (972786)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2014343829_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % (972787)% WARNING: option uhcvi not known.
% 0.17/0.47 % TRYING [4]
% 0.17/0.47 % (972789)dis+10_1_sil=32000:sp=arity:random_seed=1522985404:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (972787)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1127137750:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (972788)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2283901706:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (972790)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3059470267:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (972791)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1390501333:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (972792)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=838252069:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % (972790) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-972781-972790"...
% 0.17/0.47 % (972790)...printing done.
% 0.17/0.47 % (972787) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-972781-972787"...
% 0.17/0.47 % (972789) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-972781-972789"...
% 0.17/0.47 % (972790)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (972790)------------------------------
% 0.17/0.47 % (972790)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (972790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (972790)CaDiCaL version: 2.1.3
% 0.17/0.47 % (972790)Termination reason: Refutation
% 0.17/0.47 % (972790)Time elapsed: 0.002 s
% 0.17/0.47 % (972790)Peak memory usage: 11 MB
% 0.17/0.47 % (972790)Instructions burned: 1 (million)
% 0.17/0.47 % (972781)Success in time 0.041 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------