%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PHI015+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:27:28 PM UTC 2026
% Result : Theorem 0.05s 0.45s
% Output : Refutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 14 unt; 0 def)
% Number of atoms : 180 ( 17 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 221 ( 91 ~; 88 |; 29 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 54 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( exemplifies_property(X1,X0)
=> ( property(X1)
& object(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exemplifier_is_object_and_exemplified_is_property) ).
fof(f3,axiom,
! [X0,X1] :
( is_the(X0,X1)
=> ( property(X1)
& object(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( property(X0)
& object(X1)
& object(X2) )
=> ( ( is_the(X1,X0)
& X1 = X2 )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( object(X4)
=> ( exemplifies_property(X0,X4)
=> X4 = X3 ) )
& X3 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_axiom_identity_instance) ).
fof(f7,axiom,
! [X0] :
( object(X0)
=> ( exemplifies_property(none_greater,X0)
<=> ( exemplifies_property(conceivable,X0)
& ~ ? [X1] :
( object(X1)
& exemplifies_relation(greater_than,X1,X0)
& exemplifies_property(conceivable,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).
fof(f9,axiom,
! [X0] :
( object(X0)
=> ( ( is_the(X0,none_greater)
& ~ exemplifies_property(existence,X0) )
=> ? [X1] :
( object(X1)
& exemplifies_relation(greater_than,X1,X0)
& exemplifies_property(conceivable,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).
fof(f10,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_god) ).
fof(f11,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',god_exists) ).
fof(f12,negated_conjecture,
~ exemplifies_property(existence,god),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
~ exemplifies_property(existence,god),
inference(flattening,[],[f12]) ).
fof(f15,plain,
! [X0,X1] :
( ( property(X1)
& object(X0) )
| ~ exemplifies_property(X1,X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f16,plain,
! [X0,X1] :
( ( property(X1)
& object(X0) )
| ~ is_the(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ( is_the(X1,X0)
& X1 = X2 )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( X4 = X3
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& X3 = X2 ) )
| ~ property(X0)
| ~ object(X1)
| ~ object(X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( ( is_the(X1,X0)
& X1 = X2 )
<=> ? [X3] :
( object(X3)
& exemplifies_property(X0,X3)
& ! [X4] :
( X4 = X3
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& X3 = X2 ) )
| ~ property(X0)
| ~ object(X1)
| ~ object(X2) ),
inference(flattening,[],[f19]) ).
fof(f23,plain,
! [X0] :
( ( exemplifies_property(none_greater,X0)
<=> ( exemplifies_property(conceivable,X0)
& ! [X1] :
( ~ object(X1)
| ~ exemplifies_relation(greater_than,X1,X0)
| ~ exemplifies_property(conceivable,X1) ) ) )
| ~ object(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f24,plain,
! [X0] :
( ? [X1] :
( object(X1)
& exemplifies_relation(greater_than,X1,X0)
& exemplifies_property(conceivable,X1) )
| ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| ~ object(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f25,plain,
! [X0] :
( ? [X1] :
( object(X1)
& exemplifies_relation(greater_than,X1,X0)
& exemplifies_property(conceivable,X1) )
| ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| ~ object(X0) ),
inference(flattening,[],[f24]) ).
fof(f27,plain,
! [X0,X1] :
( ~ exemplifies_property(X1,X0)
| object(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X0,X1] :
( ~ is_the(X0,X1)
| object(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X0,X1] :
( ~ is_the(X0,X1)
| property(X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ object(X2)
| ~ object(X1)
| ~ property(X0)
| sK2(X0,X2) = X2
| X1 != X2
| ~ is_the(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ object(X2)
| ~ object(X1)
| ~ property(X0)
| exemplifies_property(X0,sK2(X0,X2))
| X1 != X2
| ~ is_the(X1,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f55,plain,
! [X0,X1] :
( ~ exemplifies_relation(greater_than,X1,X0)
| ~ exemplifies_property(conceivable,X1)
| ~ object(X0)
| ~ object(X1)
| ~ exemplifies_property(none_greater,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f59,plain,
! [X0] :
( ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| ~ object(X0)
| exemplifies_property(conceivable,sK6(X0)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f60,plain,
! [X0] :
( exemplifies_relation(greater_than,sK6(X0),X0)
| exemplifies_property(existence,X0)
| ~ is_the(X0,none_greater)
| ~ object(X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f62,plain,
is_the(god,none_greater),
inference(cnf_transformation,[],[f10]) ).
fof(f63,plain,
~ exemplifies_property(existence,god),
inference(cnf_transformation,[],[f13]) ).
fof(f65,plain,
! [X2,X0] :
( ~ object(X2)
| ~ object(X2)
| ~ property(X0)
| exemplifies_property(X0,sK2(X0,X2))
| ~ is_the(X2,X0) ),
inference(equality_resolution,[],[f49]) ).
fof(f66,plain,
! [X2,X0] :
( ~ object(X2)
| ~ object(X2)
| ~ property(X0)
| sK2(X0,X2) = X2
| ~ is_the(X2,X0) ),
inference(equality_resolution,[],[f48]) ).
fof(f81,plain,
! [X2,X0] :
( ~ is_the(X2,X0)
| ~ property(X0)
| sK2(X0,X2) = X2
| ~ object(X2) ),
inference(duplicate_literal_removal,[],[f66]) ).
fof(f82,plain,
! [X2,X0] :
( ~ is_the(X2,X0)
| ~ property(X0)
| exemplifies_property(X0,sK2(X0,X2))
| ~ object(X2) ),
inference(duplicate_literal_removal,[],[f65]) ).
fof(f86,plain,
object(god),
inference(resolution,[],[f29,f62]) ).
fof(f87,plain,
property(none_greater),
inference(resolution,[],[f30,f62]) ).
fof(f115,plain,
( exemplifies_property(existence,god)
| ~ object(god)
| exemplifies_property(conceivable,sK6(god)) ),
inference(resolution,[],[f59,f62]) ).
fof(f116,plain,
( ~ object(god)
| exemplifies_property(conceivable,sK6(god)) ),
inference(forward_subsumption_resolution,[],[f115,f63]) ).
fof(f117,plain,
exemplifies_property(conceivable,sK6(god)),
inference(forward_subsumption_resolution,[],[f116,f86]) ).
fof(f131,plain,
( ~ property(none_greater)
| god = sK2(none_greater,god)
| ~ object(god) ),
inference(resolution,[],[f81,f62]) ).
fof(f132,plain,
( god = sK2(none_greater,god)
| ~ object(god) ),
inference(forward_subsumption_resolution,[],[f131,f87]) ).
fof(f133,plain,
god = sK2(none_greater,god),
inference(forward_subsumption_resolution,[],[f132,f86]) ).
fof(f136,plain,
( ~ property(none_greater)
| exemplifies_property(none_greater,sK2(none_greater,god))
| ~ object(god) ),
inference(resolution,[],[f82,f62]) ).
fof(f137,plain,
( exemplifies_property(none_greater,sK2(none_greater,god))
| ~ object(god) ),
inference(forward_subsumption_resolution,[],[f136,f87]) ).
fof(f138,plain,
exemplifies_property(none_greater,sK2(none_greater,god)),
inference(forward_subsumption_resolution,[],[f137,f86]) ).
fof(f139,plain,
exemplifies_property(none_greater,god),
inference(forward_demodulation,[],[f138,f133]) ).
fof(f143,plain,
! [X0] :
( ~ exemplifies_property(conceivable,sK6(X0))
| ~ object(X0)
| ~ object(sK6(X0))
| ~ exemplifies_property(none_greater,X0)
| exemplifies_property(existence,X0)
| ~ is_the(X0,none_greater)
| ~ object(X0) ),
inference(resolution,[],[f55,f60]) ).
fof(f144,plain,
! [X0] :
( ~ exemplifies_property(conceivable,sK6(X0))
| ~ object(X0)
| ~ object(sK6(X0))
| ~ exemplifies_property(none_greater,X0)
| exemplifies_property(existence,X0)
| ~ is_the(X0,none_greater) ),
inference(duplicate_literal_removal,[],[f143]) ).
fof(f145,plain,
! [X0] :
( ~ exemplifies_property(conceivable,sK6(X0))
| ~ object(X0)
| ~ exemplifies_property(none_greater,X0)
| exemplifies_property(existence,X0)
| ~ is_the(X0,none_greater) ),
inference(forward_subsumption_resolution,[],[f144,f27]) ).
fof(f146,plain,
! [X0] :
( ~ is_the(X0,none_greater)
| ~ exemplifies_property(none_greater,X0)
| exemplifies_property(existence,X0)
| ~ exemplifies_property(conceivable,sK6(X0)) ),
inference(forward_subsumption_resolution,[],[f145,f27]) ).
fof(f160,plain,
( ~ exemplifies_property(none_greater,god)
| exemplifies_property(existence,god)
| ~ exemplifies_property(conceivable,sK6(god)) ),
inference(resolution,[],[f146,f62]) ).
fof(f161,plain,
( exemplifies_property(existence,god)
| ~ exemplifies_property(conceivable,sK6(god)) ),
inference(forward_subsumption_resolution,[],[f160,f139]) ).
fof(f162,plain,
~ exemplifies_property(conceivable,sK6(god)),
inference(forward_subsumption_resolution,[],[f161,f63]) ).
fof(f163,plain,
$false,
inference(forward_subsumption_resolution,[],[f162,f117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI015+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n017.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.05/0.37 % CPULimit : 300
% 0.05/0.37 % WCLimit : 300
% 0.05/0.37 % DateTime : Sun Sep 27 22:02:20 UTC 2026
% 0.05/0.38 % CPUTime :
% 0.05/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.41 Running first-order model finding
% 0.05/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.05/0.45 % (2983006)Will run a generic schedule for satisfiability detection.
% 0.05/0.45 % (2983014)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3157934257_3000 on theBenchmark for (3000ds/0Mi)
% 0.05/0.45 % TRYING [1]
% 0.05/0.45 % TRYING [2]
% 0.05/0.45 % TRYING [3]
% 0.05/0.45 % TRYING [4]
% 0.05/0.45 % (2983015)% WARNING: option uhcvi not known.
% 0.05/0.45 % TRYING [5]
% 0.05/0.45 % TRYING [6]
% 0.05/0.45 % (2983017)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1864263959:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.05/0.45 % (2983015)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2259740410:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.05/0.45 % (2983019)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=673869014:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.05/0.45 % (2983018)dis+10_1_sil=32000:sp=arity:random_seed=908563366:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.05/0.45 % (2983021)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2505069937:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.05/0.45 % (2983020)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1779140015:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.05/0.45 % TRYING [7]
% 0.05/0.45 % (2983019) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2983006-2983019"...
% 0.05/0.45 % (2983018) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2983006-2983018"...
% 0.05/0.45 % (2983019)...printing done.
% 0.05/0.45 % (2983019)Refutation found. Thanks to Tanya!
% 0.05/0.45 % SZS status Theorem for theBenchmark
% 0.05/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.05/0.45 % (2983019)------------------------------
% 0.05/0.45 % (2983019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.05/0.45 % (2983019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.05/0.45 % (2983019)CaDiCaL version: 2.1.3
% 0.05/0.45 % (2983019)Termination reason: Refutation
% 0.05/0.45 % (2983019)Time elapsed: 0.005 s
% 0.05/0.45 % (2983019)Peak memory usage: 12 MB
% 0.05/0.45 % (2983019)Instructions burned: 7 (million)
% 0.05/0.45 % (2983006)Success in time 0.029 s
% 0.05/0.45 % Vampire exiting
%------------------------------------------------------------------------------