%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM855+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 12:25:56 PM UTC 2026
% Result : Theorem 0.04s 0.40s
% Output : Refutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 25 unt; 0 def)
% Number of atoms : 70 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 19 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 60 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vmul(vd508,vd511),vmul(vd509,vd512)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq_conjunct2(315), 516, 0)') ).
fof(f2,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f6,axiom,
greater(vmul(vd508,vd511),vmul(vd509,vd511)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(315), 514, 0)') ).
fof(f7,axiom,
greater(vd511,vd512),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct2(314), 513, 0)') ).
fof(f16,axiom,
! [X0,X1,X2] : vmul(X0,vplus(X1,X2)) = vplus(vmul(X0,X1),vmul(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(281, 0), 0)') ).
fof(f17,axiom,
! [X0,X1] : vmul(X0,X1) = vmul(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).
fof(f36,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof(f41,axiom,
! [X0,X1] :
( less(X0,X1)
=> greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof(f42,axiom,
! [X0,X1] :
( greater(X0,X1)
=> less(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof(f47,axiom,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof(f48,axiom,
! [X0,X1] :
( greater(X1,X0)
<=> ? [X2] : X1 = vplus(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(f65,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
inference(flattening,[],[f2]) ).
fof(f88,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f89,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(flattening,[],[f88]) ).
fof(f92,plain,
! [X0,X1] :
( greater(X1,X0)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f93,plain,
! [X0,X1] :
( less(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f101,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd512)),
inference(cnf_transformation,[],[f65]) ).
fof(f105,plain,
greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(cnf_transformation,[],[f6]) ).
fof(f106,plain,
greater(vd511,vd512),
inference(cnf_transformation,[],[f7]) ).
fof(f115,plain,
! [X2,X0,X1] : vmul(X0,vplus(X1,X2)) = vplus(vmul(X0,X1),vmul(X0,X2)),
inference(cnf_transformation,[],[f16]) ).
fof(f116,plain,
! [X0,X1] : vmul(X0,X1) = vmul(X1,X0),
inference(cnf_transformation,[],[f17]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X2)
| less(X0,X2) ),
inference(cnf_transformation,[],[f89]) ).
fof(f147,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f148,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f153,plain,
! [X2,X0,X1] :
( vplus(X1,X2) != X0
| less(X1,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f156,plain,
! [X0,X1] :
( vplus(X0,sK1(X0,X1)) = X1
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f190,plain,
! [X2,X1] : less(X1,vplus(X1,X2)),
inference(equality_resolution,[],[f153]) ).
fof(f195,plain,
greater(vmul(vd508,vd511),vmul(vd509,vd512)),
inference(consistent_polarity_flipping,[],[f101]) ).
fof(f197,plain,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(consistent_polarity_flipping,[],[f105]) ).
fof(f198,plain,
~ greater(vd511,vd512),
inference(consistent_polarity_flipping,[],[f106]) ).
fof(f216,plain,
! [X2,X0,X1] :
( ~ less(X0,X2)
| less(X1,X2)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f138]) ).
fof(f221,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f147]) ).
fof(f222,plain,
! [X0,X1] :
( ~ less(X1,X0)
| greater(X0,X1) ),
inference(consistent_polarity_flipping,[],[f148]) ).
fof(f228,plain,
! [X2,X1] : ~ less(X1,vplus(X1,X2)),
inference(consistent_polarity_flipping,[],[f190]) ).
fof(f229,plain,
! [X0,X1] :
( greater(X1,X0)
| vplus(X0,sK1(X0,X1)) = X1 ),
inference(consistent_polarity_flipping,[],[f156]) ).
fof(f237,plain,
less(vmul(vd509,vd512),vmul(vd508,vd511)),
inference(resolution,[],[f221,f195]) ).
fof(f262,plain,
less(vmul(vd509,vd512),vmul(vd511,vd508)),
inference(forward_demodulation,[],[f237,f116]) ).
fof(f270,plain,
~ greater(vmul(vd511,vd508),vmul(vd509,vd511)),
inference(forward_demodulation,[],[f197,f116]) ).
fof(f317,plain,
! [X0] :
( less(X0,vmul(vd511,vd508))
| less(vmul(vd509,vd512),X0) ),
inference(resolution,[],[f216,f262]) ).
fof(f320,plain,
! [X0] :
( less(vmul(vd509,vd512),X0)
| greater(vmul(vd511,vd508),X0) ),
inference(resolution,[],[f317,f222]) ).
fof(f330,plain,
! [X0] : greater(vmul(vd511,vd508),vplus(vmul(vd509,vd512),X0)),
inference(resolution,[],[f320,f228]) ).
fof(f497,plain,
vd511 = vplus(vd512,sK1(vd512,vd511)),
inference(resolution,[],[f229,f198]) ).
fof(f773,plain,
! [X0] : greater(vmul(vd511,vd508),vmul(vd509,vplus(vd512,X0))),
inference(superposition,[],[f330,f115]) ).
fof(f1181,plain,
greater(vmul(vd511,vd508),vmul(vd509,vd511)),
inference(superposition,[],[f773,f497]) ).
fof(f1205,plain,
$false,
inference(forward_subsumption_resolution,[],[f1181,f270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM855+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.33 % Computer : n012.cluster.edu
% 0.04/0.33 % Model : x86_64 x86_64
% 0.04/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.33 % Memory : 8046.5625MB
% 0.04/0.33 % OS : Linux 6.8.0-71-generic
% 0.04/0.33 % CPULimit : 300
% 0.04/0.33 % WCLimit : 300
% 0.04/0.33 % DateTime : Sun Sep 27 21:31:35 UTC 2026
% 0.04/0.33 % CPUTime :
% 0.04/0.33 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.35 Running first-order model finding
% 0.04/0.35 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.04/0.40 % (2765499)Will run a generic schedule for satisfiability detection.
% 0.04/0.40 % (2765505)% WARNING: option uhcvi not known.
% 0.04/0.40 % (2765505)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=974185370:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.04/0.40 % (2765507)dis+10_1_sil=32000:sp=arity:random_seed=1059143754:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.04/0.40 % (2765504)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=762042311_2999 on theBenchmark for (2999ds/0Mi)
% 0.04/0.40 % (2765506)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=791263691:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.04/0.40 % (2765509)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2169695493:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.04/0.40 % (2765508)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4092081753:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.04/0.40 % (2765510)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4247889162:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.04/0.40 % TRYING [1]
% 0.04/0.40 % TRYING [2]
% 0.04/0.40 % TRYING [3]
% 0.04/0.40 % TRYING [4]
% 0.04/0.40 % (2765505) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2765499-2765505"...
% 0.04/0.40 % (2765505)...printing done.
% 0.04/0.40 % (2765505)Refutation found. Thanks to Tanya!
% 0.04/0.40 % SZS status Theorem for theBenchmark
% 0.04/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.04/0.40 % (2765505)------------------------------
% 0.04/0.40 % (2765505)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.04/0.40 % (2765505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.04/0.40 % (2765505)CaDiCaL version: 2.1.3
% 0.04/0.40 % (2765505)Termination reason: Refutation
% 0.04/0.40 % (2765505)Time elapsed: 0.016 s
% 0.04/0.40 % (2765505)Peak memory usage: 12 MB
% 0.04/0.40 % (2765505)Instructions burned: 45 (million)
% 0.04/0.40 % (2765499)Success in time 0.043 s
% 0.04/0.40 % Vampire exiting
%------------------------------------------------------------------------------