%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG110+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 12:36:05 PM UTC 2026
% Result : CounterSatisfiable 0.24s 0.49s
% Output : FiniteModel 0.24s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff('declare_$i1',type,
'fmb_$i_1': $i ).
tff('declare_$i2',type,
'fmb_$i_2': $i ).
tff('finite_domain_$i',axiom,
! [X: $i] :
( ( X = 'fmb_$i_1' )
| ( X = 'fmb_$i_2' ) ) ).
tff('distinct_domain_$i',axiom,
'fmb_$i_1' != 'fmb_$i_2' ).
tff(declare_sz00,type,
sz00: $i ).
tff(sz00_definition,axiom,
sz00 = 'fmb_$i_1' ).
tff(declare_sz10,type,
sz10: $i ).
tff(sz10_definition,axiom,
sz10 = 'fmb_$i_2' ).
tff(declare_xa,type,
xa: $i ).
tff(xa_definition,axiom,
xa = 'fmb_$i_2' ).
tff(declare_xb,type,
xb: $i ).
tff(xb_definition,axiom,
xb = 'fmb_$i_2' ).
tff(declare_xc,type,
xc: $i ).
tff(xc_definition,axiom,
xc = 'fmb_$i_2' ).
tff(declare_xI,type,
xI: $i ).
tff(xI_definition,axiom,
xI = 'fmb_$i_1' ).
tff(declare_smndt0,type,
smndt0: $i > $i ).
tff(function_smndt0,axiom,
( ( smndt0('fmb_$i_1') = 'fmb_$i_1' )
& ( smndt0('fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(function_sdtpldt0,axiom,
( ( sdtpldt0('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' )
& ( sdtpldt0('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( sdtpldt0('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( sdtpldt0('fmb_$i_2','fmb_$i_2') = 'fmb_$i_1' ) ) ).
tff(declare_sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(function_sdtasdt0,axiom,
( ( sdtasdt0('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' )
& ( sdtasdt0('fmb_$i_1','fmb_$i_2') = 'fmb_$i_1' )
& ( sdtasdt0('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
& ( sdtasdt0('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_sdtpldt1,type,
sdtpldt1: ( $i * $i ) > $i ).
tff(function_sdtpldt1,axiom,
( ( sdtpldt1('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' )
& ( sdtpldt1('fmb_$i_1','fmb_$i_2') = 'fmb_$i_1' )
& ( sdtpldt1('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
& ( sdtpldt1('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(function_sdtasasdt0,axiom,
( ( sdtasasdt0('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' )
& ( sdtasasdt0('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( sdtasasdt0('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( sdtasasdt0('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(function_sbrdtbr0,axiom,
( ( sbrdtbr0('fmb_$i_1') = 'fmb_$i_1' )
& ( sbrdtbr0('fmb_$i_2') = 'fmb_$i_1' ) ) ).
tff(declare_slsdtgt0,type,
slsdtgt0: $i > $i ).
tff(function_slsdtgt0,axiom,
( ( slsdtgt0('fmb_$i_1') = 'fmb_$i_2' )
& ( slsdtgt0('fmb_$i_2') = 'fmb_$i_1' ) ) ).
tff(declare_aElement0,type,
aElement0: $i > $o ).
tff(predicate_aElement0,axiom,
( aElement0('fmb_$i_1')
& aElement0('fmb_$i_2') ) ).
tff(declare_aSet0,type,
aSet0: $i > $o ).
tff(predicate_aSet0,axiom,
( aSet0('fmb_$i_1')
& aSet0('fmb_$i_2') ) ).
tff(declare_aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(predicate_aElementOf0,axiom,
( aElementOf0('fmb_$i_1','fmb_$i_1')
& aElementOf0('fmb_$i_1','fmb_$i_2')
& aElementOf0('fmb_$i_2','fmb_$i_1')
& ~ aElementOf0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aIdeal0,type,
aIdeal0: $i > $o ).
tff(predicate_aIdeal0,axiom,
( aIdeal0('fmb_$i_1')
& aIdeal0('fmb_$i_2') ) ).
tff(declare_sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff(predicate_sdteqdtlpzmzozddtrp0,axiom,
( sdteqdtlpzmzozddtrp0('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& sdteqdtlpzmzozddtrp0('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& sdteqdtlpzmzozddtrp0('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& ~ sdteqdtlpzmzozddtrp0('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& sdteqdtlpzmzozddtrp0('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& ~ sdteqdtlpzmzozddtrp0('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& sdteqdtlpzmzozddtrp0('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& sdteqdtlpzmzozddtrp0('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(predicate_aNaturalNumber0,axiom,
( aNaturalNumber0('fmb_$i_1')
& aNaturalNumber0('fmb_$i_2') ) ).
tff(declare_iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(predicate_iLess0,axiom,
( iLess0('fmb_$i_1','fmb_$i_1')
& iLess0('fmb_$i_1','fmb_$i_2')
& iLess0('fmb_$i_2','fmb_$i_1')
& iLess0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff(predicate_doDivides0,axiom,
( doDivides0('fmb_$i_1','fmb_$i_1')
& ~ doDivides0('fmb_$i_1','fmb_$i_2')
& doDivides0('fmb_$i_2','fmb_$i_1')
& doDivides0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(predicate_aDivisorOf0,axiom,
( aDivisorOf0('fmb_$i_1','fmb_$i_1')
& ~ aDivisorOf0('fmb_$i_1','fmb_$i_2')
& aDivisorOf0('fmb_$i_2','fmb_$i_1')
& aDivisorOf0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aGcdOfAnd0,type,
aGcdOfAnd0: ( $i * $i * $i ) > $o ).
tff(predicate_aGcdOfAnd0,axiom,
( aGcdOfAnd0('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& ~ aGcdOfAnd0('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& ~ aGcdOfAnd0('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& ~ aGcdOfAnd0('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& ~ aGcdOfAnd0('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& aGcdOfAnd0('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& aGcdOfAnd0('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& aGcdOfAnd0('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_misRelativelyPrime0,type,
misRelativelyPrime0: ( $i * $i ) > $o ).
tff(predicate_misRelativelyPrime0,axiom,
( ~ misRelativelyPrime0('fmb_$i_1','fmb_$i_1')
& misRelativelyPrime0('fmb_$i_1','fmb_$i_2')
& misRelativelyPrime0('fmb_$i_2','fmb_$i_1')
& misRelativelyPrime0('fmb_$i_2','fmb_$i_2') ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG110+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n015.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 23:22:16 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.24/0.49 % (2125344)Will run a generic schedule for satisfiability detection.
% 0.24/0.49 % (2125352)dis+10_1_sil=32000:sp=arity:random_seed=2106260031:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.24/0.49 % (2125350)% WARNING: option uhcvi not known.
% 0.24/0.49 % (2125349)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1864684092_2999 on theBenchmark for (2999ds/0Mi)
% 0.24/0.49 % (2125350)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2974746119:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.24/0.49 % (2125354)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1627460915:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.24/0.49 % (2125351)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1527053320:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.49 % (2125353)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=272832360:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.49 % (2125355)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3664144269:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.24/0.49 % TRYING [1]
% 0.24/0.49 % TRYING [2]
% 0.24/0.49 % Finite Model Found!
% 0.24/0.49 % SZS status CounterSatisfiable for theBenchmark
% 0.24/0.49 % (2125349) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2125344-2125349"...
% 0.24/0.49 % (2125349)...printing done.
% 0.24/0.49 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.24/0.49 % (2125349)------------------------------
% 0.24/0.49 % (2125349)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.49 % (2125349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.49 % (2125349)CaDiCaL version: 2.1.3
% 0.24/0.49 % (2125349)Termination reason: Satisfiable
% 0.24/0.49 % (2125349)Time elapsed: 0.018 s
% 0.24/0.49 % (2125349)Peak memory usage: 13 MB
% 0.24/0.49 % (2125349)Instructions burned: 33 (million)
% 0.24/0.49 % (2125344)Success in time 0.059 s
% 0.24/0.49 % Vampire exiting
%------------------------------------------------------------------------------