%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM393+1 : TPTP v9.3.1. Released v3.2.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 12:24:06 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 25 ~; 37 |; 4 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 36 ( 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(f8,axiom,
! [X0,X1] :
( inclusion_comparable(X0,X1)
<=> ( subset(X0,X1)
| subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(f24,axiom,
! [X0,X1] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f30,conjecture,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> inclusion_comparable(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_ordinal1) ).
fof(f31,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> inclusion_comparable(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f55,plain,
! [X0,X1] :
( ordinal_subset(X0,X1)
| ordinal_subset(X1,X0)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f56,plain,
! [X0,X1] :
( ordinal_subset(X0,X1)
| ordinal_subset(X1,X0)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f58,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(flattening,[],[f57]) ).
fof(f63,plain,
? [X0] :
( ? [X1] :
( ~ inclusion_comparable(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f78,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ordinal_subset(X1,X0)
| ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f80,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| inclusion_comparable(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f81,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| inclusion_comparable(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f110,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| subset(X0,X1)
| ~ ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f116,plain,
ordinal(sK13),
inference(cnf_transformation,[],[f63]) ).
fof(f117,plain,
~ inclusion_comparable(sK12,sK13),
inference(cnf_transformation,[],[f63]) ).
fof(f118,plain,
ordinal(sK12),
inference(cnf_transformation,[],[f63]) ).
fof(f133,plain,
! [X0,X1] :
( ~ ordinal_subset(X0,X1)
| ordinal(X0)
| ~ ordinal_subset(X1,X0)
| ordinal(X1) ),
inference(consistent_polarity_flipping,[],[f78]) ).
fof(f134,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| subset(X0,X1) ),
inference(consistent_polarity_flipping,[],[f81]) ).
fof(f135,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| subset(X1,X0) ),
inference(consistent_polarity_flipping,[],[f80]) ).
fof(f154,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ordinal(X0)
| ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(consistent_polarity_flipping,[],[f110]) ).
fof(f159,plain,
~ ordinal(sK12),
inference(consistent_polarity_flipping,[],[f118]) ).
fof(f160,plain,
~ ordinal(sK13),
inference(consistent_polarity_flipping,[],[f116]) ).
fof(f194,plain,
subset(sK12,sK13),
inference(resolution,[],[f134,f117]) ).
fof(f196,plain,
subset(sK13,sK12),
inference(resolution,[],[f135,f117]) ).
fof(f222,plain,
( ordinal(sK12)
| ordinal(sK13)
| ordinal_subset(sK12,sK13) ),
inference(resolution,[],[f154,f194]) ).
fof(f223,plain,
( ordinal(sK13)
| ordinal_subset(sK12,sK13) ),
inference(forward_subsumption_resolution,[],[f222,f159]) ).
fof(f224,plain,
ordinal_subset(sK12,sK13),
inference(forward_subsumption_resolution,[],[f223,f160]) ).
fof(f225,plain,
( ordinal(sK13)
| ordinal(sK12)
| ordinal_subset(sK13,sK12) ),
inference(resolution,[],[f196,f154]) ).
fof(f229,plain,
( ordinal(sK12)
| ordinal_subset(sK13,sK12) ),
inference(forward_subsumption_resolution,[],[f225,f160]) ).
fof(f230,plain,
ordinal_subset(sK13,sK12),
inference(forward_subsumption_resolution,[],[f229,f159]) ).
fof(f242,plain,
( ordinal(sK13)
| ~ ordinal_subset(sK12,sK13)
| ordinal(sK12) ),
inference(resolution,[],[f230,f133]) ).
fof(f243,plain,
( ~ ordinal_subset(sK12,sK13)
| ordinal(sK12) ),
inference(forward_subsumption_resolution,[],[f242,f160]) ).
fof(f244,plain,
ordinal(sK12),
inference(forward_subsumption_resolution,[],[f243,f224]) ).
fof(f245,plain,
$false,
inference(forward_subsumption_resolution,[],[f244,f159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM393+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n002.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 19:48:51 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.10/0.46 % (3835887)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (3835893)% WARNING: option uhcvi not known.
% 0.10/0.46 % (3835893)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1438066130:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % (3835893) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3835887-3835893"...
% 0.10/0.46 % (3835893)...printing done.
% 0.10/0.46 % (3835893)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (3835893)------------------------------
% 0.10/0.46 % (3835893)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (3835893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (3835893)CaDiCaL version: 2.1.3
% 0.10/0.46 % (3835893)Termination reason: Refutation
% 0.10/0.46 % (3835893)Time elapsed: 0.002 s
% 0.10/0.46 % (3835893)Peak memory usage: 12 MB
% 0.10/0.46 % (3835893)Instructions burned: 4 (million)
% 0.10/0.46 % (3835887)Success in time 0.033 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------