%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP168-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:13:09 AM UTC 2026
% Result : Unsatisfiable 2.57s 1.36s
% Output : Refutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 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 : 8 ( 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f17,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p01a_1) ).
fof(f18,plain,
b = least_upper_bound(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p01a) ).
fof(f20,plain,
multiply(inverse(c),multiply(b,c)) != least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))),
inference(reorient_equations,[],[f19]) ).
fof(f21,plain,
b = least_upper_bound(b,a),
inference(superposition,[],[f6,f18]) ).
fof(f265,plain,
multiply(inverse(c),multiply(b,c)) != multiply(inverse(c),least_upper_bound(multiply(a,c),multiply(b,c))),
inference(superposition,[],[f20,f13]) ).
fof(f273,plain,
multiply(inverse(c),multiply(b,c)) != multiply(inverse(c),least_upper_bound(multiply(b,c),multiply(a,c))),
inference(forward_demodulation,[],[f265,f6]) ).
fof(f524,plain,
multiply(inverse(c),multiply(b,c)) != multiply(inverse(c),multiply(least_upper_bound(b,a),c)),
inference(superposition,[],[f273,f15]) ).
fof(f535,plain,
multiply(inverse(c),multiply(b,c)) != multiply(inverse(c),multiply(b,c)),
inference(forward_demodulation,[],[f524,f21]) ).
fof(f536,plain,
$false,
inference(trivial_inequality_removal,[],[f535]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP168-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 % Computer : n015.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Sun Sep 27 09:38:15 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.57/1.36 % (1402921)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.57/1.36 % (1403029)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=866223787:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.57/1.36 % (1403029)First to succeed.
% 2.57/1.36 % (1403029)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1402921"
% 2.57/1.36 % (1403025)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2836750778:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.57/1.36 % (1403024)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1111119802:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.57/1.36 % (1403023)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=650823451:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.57/1.36 % (1403026)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2045989764:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.57/1.36 % (1403027)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1244333080:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.57/1.36 % (1403026)Also succeeded, but the first one will report.
% 2.57/1.36 % (1403028)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1824142372:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.57/1.36 % (1403028)Also succeeded, but the first one will report.
% 2.57/1.36 % (1403027)Instruction limit reached!
% 2.57/1.36 % (1403027)------------------------------
% 2.57/1.36 % (1403027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.36 % (1403027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.36 % (1403027)CaDiCaL version: 2.1.3
% 2.57/1.36 % (1403027)Termination reason: Instruction limit
% 2.57/1.36 % (1403027)Termination phase: Saturation
% 2.57/1.36 % (1403027)Time elapsed: 0.108 s
% 2.57/1.36 % (1403027)Peak memory usage: 89 MB
% 2.57/1.36 % (1403027)Instructions burned: 182 (million)
% 2.57/1.36 % (1403029)Refutation found. Thanks to Tanya!
% 2.57/1.36 % SZS status Unsatisfiable for theBenchmark
% 2.57/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 2.57/1.36 % (1403029)------------------------------
% 2.57/1.36 % (1403029)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.36 % (1403029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.36 % (1403029)CaDiCaL version: 2.1.3
% 2.57/1.36 % (1403029)Termination reason: Refutation
% 2.57/1.36 % (1403029)Time elapsed: 0.007 s
% 2.57/1.36 % (1403029)Peak memory usage: 88 MB
% 2.57/1.36 % (1403029)Instructions burned: 19 (million)
% 2.57/1.36 % (1403029)------------------------------
% 2.57/1.36 % (1403029)------------------------------
% 2.57/1.36 % (1402921)Success in time 0.283 s
% 2.57/1.36 % Vampire exiting
%------------------------------------------------------------------------------