%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP067-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:34 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 36 unt; 3 def)
% Number of atoms : 73 ( 45 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 18 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(divide(X0,X0),divide(X0,divide(X1,divide(divide(identity,X0),X2)))),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0] : inverse(X0) = divide(identity,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,plain,
! [X0] : divide(identity,X0) = inverse(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f6,plain,
! [X0] : divide(X0,X0) = identity,
inference(reorient_equations,[],[f5]) ).
fof(f7,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
fof(f8,plain,
( identity != multiply(inverse(a1),a1)
| a2 != multiply(identity,a2)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(reorient_equations,[],[f7]) ).
fof(f9,plain,
( identity != divide(divide(identity,a1),divide(identity,a1))
| a2 != divide(identity,divide(identity,a2))
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) ),
inference(definition_unfolding,[],[f8,f2,f4,f2,f2,f2,f2,f2]) ).
fof(f11,definition,
( spl0_1
<=> divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3)))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f13,plain,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| spl0_1 ),
inference(avatar_component_clause,[],[f11]) ).
fof(f15,definition,
( spl0_2
<=> a2 = divide(identity,divide(identity,a2)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f17,plain,
( a2 != divide(identity,divide(identity,a2))
| spl0_2 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f19,definition,
( spl0_3
<=> identity = divide(divide(identity,a1),divide(identity,a1)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f21,plain,
( identity != divide(divide(identity,a1),divide(identity,a1))
| spl0_3 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f22,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f9,f19,f15,f11]) ).
fof(f23,plain,
! [X2,X0,X1] : divide(divide(identity,divide(X0,divide(X1,divide(divide(identity,X0),X2)))),X2) = X1,
inference(forward_demodulation,[],[f1,f6]) ).
fof(f24,plain,
! [X0,X1] : divide(divide(identity,divide(identity,divide(X0,divide(identity,X1)))),X1) = X0,
inference(superposition,[],[f23,f6]) ).
fof(f26,plain,
! [X0,X1] : divide(divide(identity,divide(X0,divide(X1,identity))),divide(identity,X0)) = X1,
inference(superposition,[],[f23,f6]) ).
fof(f29,plain,
! [X0] : divide(divide(identity,divide(identity,divide(X0,identity))),identity) = X0,
inference(superposition,[],[f24,f6]) ).
fof(f48,plain,
! [X0] : divide(divide(identity,identity),divide(identity,divide(X0,identity))) = X0,
inference(superposition,[],[f26,f6]) ).
fof(f55,plain,
! [X0] : divide(identity,divide(identity,divide(X0,identity))) = X0,
inference(forward_demodulation,[],[f48,f6]) ).
fof(f60,plain,
! [X0] : divide(identity,divide(identity,divide(X0,identity))) = divide(identity,divide(identity,X0)),
inference(superposition,[],[f55,f29]) ).
fof(f61,plain,
! [X0] : divide(X0,identity) = X0,
inference(superposition,[],[f29,f55]) ).
fof(f72,plain,
! [X0] : divide(identity,divide(identity,X0)) = X0,
inference(forward_demodulation,[],[f60,f55]) ).
fof(f100,plain,
! [X0,X1] : divide(divide(X0,divide(identity,X1)),X1) = X0,
inference(superposition,[],[f24,f72]) ).
fof(f109,plain,
! [X0,X1] : divide(divide(identity,divide(identity,divide(X1,X0))),divide(identity,X0)) = X1,
inference(superposition,[],[f24,f72]) ).
fof(f116,plain,
! [X0,X1] : divide(divide(X1,X0),divide(identity,X0)) = X1,
inference(forward_demodulation,[],[f109,f72]) ).
fof(f131,plain,
! [X0,X1] : divide(identity,divide(X1,divide(X0,identity))) = divide(X0,X1),
inference(superposition,[],[f100,f26]) ).
fof(f153,plain,
! [X0,X1] : divide(identity,divide(X1,X0)) = divide(X0,X1),
inference(forward_demodulation,[],[f131,f61]) ).
fof(f192,plain,
! [X0,X1] : divide(identity,X0) = divide(X1,divide(X0,divide(identity,X1))),
inference(superposition,[],[f153,f100]) ).
fof(f208,plain,
! [X2,X0,X1] : divide(divide(X2,divide(X1,X0)),divide(X0,X1)) = X2,
inference(superposition,[],[f116,f153]) ).
fof(f279,plain,
! [X2,X0,X1] : divide(divide(identity,divide(X1,divide(X2,divide(identity,X0)))),divide(X0,divide(identity,divide(identity,X1)))) = X2,
inference(superposition,[],[f23,f192]) ).
fof(f299,plain,
! [X2,X0,X1] : divide(divide(identity,divide(X1,divide(X2,divide(identity,X0)))),divide(X0,X1)) = X2,
inference(forward_demodulation,[],[f279,f72]) ).
fof(f321,plain,
! [X2,X0,X1] : divide(divide(divide(X2,divide(identity,X0)),X1),divide(X0,X1)) = X2,
inference(forward_demodulation,[],[f299,f153]) ).
fof(f427,plain,
! [X2,X0,X1] : divide(divide(identity,divide(X1,X0)),X2) = divide(X0,divide(X2,divide(identity,X1))),
inference(superposition,[],[f23,f208]) ).
fof(f439,plain,
! [X2,X0,X1] : divide(X0,divide(X2,divide(identity,X1))) = divide(divide(X0,X1),X2),
inference(forward_demodulation,[],[f427,f153]) ).
fof(f774,plain,
! [X2,X0,X1] : divide(X0,divide(X2,X1)) = divide(divide(X0,divide(identity,X1)),X2),
inference(superposition,[],[f208,f321]) ).
fof(f1400,plain,
( divide(a3,divide(identity,divide(b3,divide(identity,c3)))) != divide(a3,divide(divide(identity,c3),b3))
| spl0_1 ),
inference(superposition,[],[f13,f774]) ).
fof(f1469,plain,
( divide(a3,divide(divide(identity,c3),b3)) != divide(a3,divide(divide(identity,c3),b3))
| spl0_1 ),
inference(forward_demodulation,[],[f1400,f439]) ).
fof(f1470,plain,
( $false
| spl0_1 ),
inference(trivial_inequality_removal,[],[f1469]) ).
fof(f1471,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f1470]) ).
fof(f1544,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f17,f72]) ).
fof(f1545,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f1544]) ).
fof(f1546,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f21,f6]) ).
fof(f1547,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f1546]) ).
cnf(s5,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f22]) ).
cnf(s249,plain,
spl0_1,
inference(sat_conversion,[],[f1471]) ).
cnf(s267,plain,
spl0_2,
inference(sat_conversion,[],[f1545]) ).
cnf(s268,plain,
spl0_3,
inference(sat_conversion,[],[f1547]) ).
cnf(s269,plain,
$false,
inference(rat,[],[s5,s268,s267,s249]) ).
fof(f1548,plain,
$false,
inference(avatar_sat_refutation,[],[s269]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP067-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 09:19:38 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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.17/0.47 % (2065416)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (2065423)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2805058856:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (2065422)% WARNING: option uhcvi not known.
% 0.17/0.47 % (2065421)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2760421593_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (2065422)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3189338109:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (2065424)dis+10_1_sil=32000:sp=arity:random_seed=3545741064:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (2065426)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2748172719:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (2065425)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4157999564:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (2065427)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3828619477:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % TRYING [4]
% 0.17/0.47 % (2065423) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2065416-2065423"...
% 0.17/0.47 % (2065423)...printing done.
% 0.17/0.47 % (2065423)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 % (2065423)------------------------------
% 0.17/0.47 % (2065423)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (2065423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (2065423)CaDiCaL version: 2.1.3
% 0.17/0.47 % (2065423)Termination reason: Refutation
% 0.17/0.47 % (2065423)Time elapsed: 0.017 s
% 0.17/0.47 % (2065423)Peak memory usage: 12 MB
% 0.17/0.47 % (2065423)Instructions burned: 51 (million)
% 0.17/0.47 % (2065416)Success in time 0.049 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------