%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP613-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:13 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.48s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 11 ( 3 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 : 40 ( 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(definition_unfolding,[],[f3,f2,f2]) ).
fof(f5,plain,
! [X2,X0,X1] : double_divide(inverse(X0),double_divide(inverse(double_divide(X1,inverse(X0))),double_divide(X1,inverse(X2)))) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X0))),X2)),inverse(X3))),double_divide(X1,X2))),X0) = X3,
inference(superposition,[],[f1,f1]) ).
fof(f15,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(inverse(X0),double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(inverse(X2)))),X3)),double_divide(X1,X3)))),X0) = X2,
inference(superposition,[],[f6,f6]) ).
fof(f27,plain,
! [X2,X0] : double_divide(inverse(double_divide(inverse(X0),inverse(X2))),X0) = X2,
inference(forward_demodulation,[],[f15,f1]) ).
fof(f33,plain,
! [X0,X1] : double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
inference(superposition,[],[f1,f27]) ).
fof(f44,plain,
! [X0,X1] : double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X0)) = X0,
inference(superposition,[],[f33,f27]) ).
fof(f66,plain,
! [X2,X0,X1] : double_divide(inverse(X0),double_divide(inverse(X0),double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X2)))) = X2,
inference(superposition,[],[f5,f44]) ).
fof(f70,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X2))),inverse(X0))),X0) = X2,
inference(superposition,[],[f1,f44]) ).
fof(f73,plain,
! [X2,X0] : double_divide(inverse(double_divide(inverse(X2),inverse(X0))),X0) = X2,
inference(forward_demodulation,[],[f70,f44]) ).
fof(f76,plain,
! [X2,X0] : double_divide(inverse(X0),double_divide(inverse(X0),X2)) = X2,
inference(forward_demodulation,[],[f66,f44]) ).
fof(f85,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(inverse(X0),X0),
inference(superposition,[],[f76,f33]) ).
fof(f152,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f73,f44]) ).
fof(f190,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(X0,inverse(X0)),
inference(superposition,[],[f85,f152]) ).
fof(f306,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[],[f190,f152]) ).
fof(f730,plain,
! [X0] : inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(X0,inverse(X0))),
inference(superposition,[],[f4,f306]) ).
fof(f817,plain,
$false,
inference(equality_resolution,[],[f730]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP613-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 10:12:21 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.48 % (3318397)Will run a generic schedule for satisfiability detection.
% 0.15/0.48 % (3318402)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2666104417_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.48 % TRYING [1]
% 0.15/0.48 % TRYING [2]
% 0.15/0.48 % TRYING [3]
% 0.15/0.48 % (3318403)% WARNING: option uhcvi not known.
% 0.15/0.48 % TRYING [4]
% 0.15/0.48 % (3318403)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3574550675:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.48 % (3318404)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4279849526:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.48 % (3318405)dis+10_1_sil=32000:sp=arity:random_seed=3059240099:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.48 % (3318406)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=613518032:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.48 % (3318408)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2066512606:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.48 % (3318407)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4045075452:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.48 % (3318404) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3318397-3318404"...
% 0.15/0.48 % (3318404)...printing done.
% 0.15/0.48 % (3318404)Refutation found. Thanks to Tanya!
% 0.15/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48 % (3318404)------------------------------
% 0.15/0.48 % (3318404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.48 % (3318404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.48 % (3318404)CaDiCaL version: 2.1.3
% 0.15/0.48 % (3318404)Termination reason: Refutation
% 0.15/0.48 % (3318404)Time elapsed: 0.025 s
% 0.15/0.48 % (3318404)Peak memory usage: 12 MB
% 0.15/0.48 % (3318404)Instructions burned: 41 (million)
% 0.15/0.48 % (3318397)Success in time 0.063 s
% 0.15/0.48 % Vampire exiting
%------------------------------------------------------------------------------