%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP448-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:17:51 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.37s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(divide(divide(X1,X1),X0),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,plain,
! [X0,X1] : divide(divide(X1,X1),X0) = inverse(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f6,plain,
! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
inference(superposition,[],[f4,f4]) ).
fof(f15,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f2,f4]) ).
fof(f16,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(divide(X1,X1),X0),
inference(superposition,[],[f15,f4]) ).
fof(f17,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(inverse(divide(X1,X1)),X0),
inference(superposition,[],[f15,f6]) ).
fof(f21,plain,
! [X0,X1] : inverse(X1) = divide(multiply(inverse(X0),X0),X1),
inference(superposition,[],[f4,f15]) ).
fof(f38,plain,
! [X0,X1] : inverse(inverse(X1)) = multiply(inverse(inverse(multiply(inverse(X0),X0))),X1),
inference(superposition,[],[f17,f21]) ).
fof(f50,plain,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X1,X1),X1),X2),divide(inverse(X0),X2))) = X1,
inference(forward_demodulation,[],[f1,f4]) ).
fof(f51,plain,
! [X2,X0,X1] : divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(forward_demodulation,[],[f50,f4]) ).
fof(f170,plain,
! [X0,X1] : divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[],[f51,f4]) ).
fof(f180,plain,
! [X2,X0,X1] : inverse(divide(divide(inverse(X0),X2),divide(inverse(divide(X1,X1)),X2))) = X0,
inference(superposition,[],[f4,f51]) ).
fof(f195,plain,
! [X2,X0] : inverse(divide(divide(inverse(X0),X2),inverse(X2))) = X0,
inference(forward_demodulation,[],[f180,f6]) ).
fof(f203,plain,
! [X0,X1] : multiply(X0,divide(inverse(X0),inverse(X1))) = X1,
inference(forward_demodulation,[],[f170,f15]) ).
fof(f219,plain,
! [X2,X0] : inverse(multiply(divide(inverse(X0),X2),X2)) = X0,
inference(forward_demodulation,[],[f195,f15]) ).
fof(f227,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f203,f15]) ).
fof(f248,plain,
! [X0,X1] : inverse(inverse(multiply(inverse(divide(X1,X1)),X0))) = X0,
inference(superposition,[],[f16,f227]) ).
fof(f259,plain,
! [X0] : inverse(inverse(inverse(inverse(X0)))) = X0,
inference(forward_demodulation,[],[f248,f17]) ).
fof(f284,plain,
! [X0,X1] : divide(X1,X1) = inverse(multiply(inverse(X0),X0)),
inference(superposition,[],[f219,f6]) ).
fof(f389,plain,
! [X0,X1] : divide(X1,X1) = inverse(inverse(inverse(inverse(multiply(inverse(X0),X0))))),
inference(superposition,[],[f284,f38]) ).
fof(f461,plain,
! [X0,X1] : divide(X1,X1) = multiply(inverse(X0),X0),
inference(forward_demodulation,[],[f389,f259]) ).
fof(f1066,plain,
! [X0] : multiply(inverse(a1),a1) != divide(X0,X0),
inference(superposition,[],[f5,f461]) ).
fof(f1071,plain,
$false,
inference(forward_subsumption_resolution,[],[f1066,f461]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP448-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Sun Sep 27 10:04:35 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.04/0.32 Running first-order model finding
% 0.04/0.32 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.08/0.37 % (2138383)Will run a generic schedule for satisfiability detection.
% 0.08/0.37 % (2138389)% WARNING: option uhcvi not known.
% 0.08/0.37 % (2138394)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1702925181:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.37 % (2138389)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1512395874:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.37 % (2138388)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3545324102_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.37 % (2138391)dis+10_1_sil=32000:sp=arity:random_seed=1742098245:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.37 % (2138390)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=219903646:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.37 % (2138392)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2432401919:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.37 % (2138393)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1805920689:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.37 % TRYING [1]
% 0.08/0.37 % TRYING [2]
% 0.08/0.37 % TRYING [3]
% 0.08/0.37 % TRYING [4]
% 0.08/0.37 % (2138390) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2138383-2138390"...
% 0.08/0.37 % (2138390)...printing done.
% 0.08/0.37 % (2138390)Refutation found. Thanks to Tanya!
% 0.08/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.37 % (2138390)------------------------------
% 0.08/0.37 % (2138390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.37 % (2138390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.37 % (2138390)CaDiCaL version: 2.1.3
% 0.08/0.37 % (2138390)Termination reason: Refutation
% 0.08/0.37 % (2138390)Time elapsed: 0.012 s
% 0.08/0.37 % (2138390)Peak memory usage: 11 MB
% 0.08/0.37 % (2138390)Instructions burned: 40 (million)
% 0.08/0.37 % (2138383)Success in time 0.037 s
% 0.08/0.37 % Vampire exiting
%------------------------------------------------------------------------------