%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP156-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 : n026.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:58 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono1c_1) ).
fof(f18,plain,
b = least_upper_bound(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_mono1c) ).
fof(f20,plain,
multiply(a,c) != greatest_lower_bound(multiply(a,c),multiply(b,c)),
inference(reorient_equations,[],[f19]) ).
fof(f24,plain,
a = greatest_lower_bound(a,b),
inference(superposition,[],[f12,f18]) ).
fof(f172,plain,
multiply(a,c) != multiply(greatest_lower_bound(a,b),c),
inference(superposition,[],[f20,f16]) ).
fof(f181,plain,
multiply(a,c) != multiply(a,c),
inference(forward_demodulation,[],[f172,f24]) ).
fof(f182,plain,
$false,
inference(trivial_inequality_removal,[],[f181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP156-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 09:36:41 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.44 % (2575828)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (2575835)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1589519590:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.44 % (2575834)% WARNING: option uhcvi not known.
% 0.10/0.44 % (2575833)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=269594356_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.44 % (2575834)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3966104501:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.44 % (2575836)dis+10_1_sil=32000:sp=arity:random_seed=2917328628:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.44 % (2575839)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4100555400:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.44 % (2575837)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1799990537:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44 % (2575838)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3906051851:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.44 % TRYING [1]
% 0.10/0.44 % TRYING [2]
% 0.10/0.44 % TRYING [3]
% 0.10/0.44 % (2575836) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2575828-2575836"...
% 0.10/0.44 % (2575834) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2575828-2575834"...
% 0.10/0.44 % (2575837) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2575828-2575837"...
% 0.10/0.44 % (2575838) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2575828-2575838"...
% 0.10/0.44 % (2575836)...printing done.
% 0.10/0.44 % (2575834)...printing done.
% 0.10/0.44 % (2575837)...printing done.
% 0.10/0.44 % (2575838)...printing done.
% 0.10/0.44 % (2575834)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (2575834)------------------------------
% 0.10/0.44 % (2575834)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (2575834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (2575834)CaDiCaL version: 2.1.3
% 0.10/0.44 % (2575834)Termination reason: Refutation
% 0.10/0.44 % (2575834)Time elapsed: 0.007 s
% 0.10/0.44 % (2575834)Peak memory usage: 11 MB
% 0.10/0.44 % (2575834)Instructions burned: 8 (million)
% 0.10/0.44 % (2575828)Success in time 0.04 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------