%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO207_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 02:25:42 PM UTC 2026
% Result : Theorem 2.68s 1.15s
% Output : Refutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 193 ( 78 equ)
% Maximal formula atoms : 16 ( 9 avg)
% Number of connectives : 86 ( 33 ~; 37 |; 10 &)
% ( 5 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 156 ( 120 fml; 36 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 12 ( 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_2,type,
sK0: $o ).
tff(func_def_3,type,
sK1: $o ).
tff(f1,conjecture,
! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
= ( (X1) = (X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT26) ).
tff(f2,negated_conjecture,
~ ! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
= ( (X1) = (X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
= ( (X1) = (X0) ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ! [X0: $o,X1: $o] :
( ( ( $true = (X0) )
<=> ( $true = (X1) ) )
<=> ( ( $true = (X1) )
<=> ( $true = (X0) ) ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
? [X0: $o,X1: $o] :
( ( ( $true = (X0) )
<=> ( $true = (X1) ) )
<~> ( ( $true = (X1) )
<=> ( $true = (X0) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
? [X0: $o,X1: $o] :
( ( ( ( ( $true != (X0) )
| ( $true != (X1) ) )
& ( ( $true = (X0) )
| ( $true = (X1) ) ) )
| ( ( ( $true != (X1) )
| ( $true != (X0) ) )
& ( ( $true = (X1) )
| ( $true = (X0) ) ) ) )
& ( ( ( ( $true = (X1) )
| ( $true != (X0) ) )
& ( ( $true = (X0) )
| ( $true != (X1) ) ) )
| ( ( ( $true = (X0) )
| ( $true != (X1) ) )
& ( ( $true = (X1) )
| ( $true != (X0) ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f7,plain,
( ( ( ( ( $true != sK0 )
| ( $true != sK1 ) )
& ( ( $true = sK0 )
| ( $true = sK1 ) ) )
| ( ( ( $true != sK1 )
| ( $true != sK0 ) )
& ( ( $true = sK1 )
| ( $true = sK0 ) ) ) )
& ( ( ( ( $true = sK1 )
| ( $true != sK0 ) )
& ( ( $true = sK0 )
| ( $true != sK1 ) ) )
| ( ( ( $true = sK0 )
| ( $true != sK1 ) )
& ( ( $true = sK1 )
| ( $true != sK0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
tff(f9,plain,
( ( $true = sK0 )
| ( $true != sK1 )
| ( $true = sK0 )
| ( $true != sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f10,plain,
( ( $true = sK1 )
| ( $true != sK0 )
| ( $true = sK1 )
| ( $true != sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
( ( $true = sK0 )
| ( $true = sK1 )
| ( $true = sK1 )
| ( $true = sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f15,plain,
( ( $true != sK0 )
| ( $true != sK1 )
| ( $true != sK1 )
| ( $true != sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f18,plain,
( ( $true != sK1 )
| ( $true = sK0 ) ),
inference(duplicate_literal_removal,[],[f9]) ).
tff(f19,plain,
( ( $true != sK0 )
| ( $true = sK1 ) ),
inference(duplicate_literal_removal,[],[f10]) ).
tff(f20,plain,
( ( $true = sK0 )
| ( $true = sK1 ) ),
inference(duplicate_literal_removal,[],[f12]) ).
tff(f21,plain,
( ( $true != sK0 )
| ( $true != sK1 ) ),
inference(duplicate_literal_removal,[],[f15]) ).
tff(f22,plain,
$true = sK1,
inference(forward_subsumption_resolution,[],[f20,f19]) ).
tff(f23,plain,
( ( $true != $true )
| ( $true = sK0 ) ),
inference(superposition,[],[f18,f22]) ).
tff(f24,plain,
$true = sK0,
inference(trivial_inequality_removal,[],[f23]) ).
tff(f27,plain,
$true != sK0,
inference(forward_subsumption_resolution,[],[f21,f19]) ).
tff(f28,plain,
$false,
inference(forward_subsumption_resolution,[],[f27,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO207_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n006.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 17:31:55 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.15 % (4156690)Detected formulas, will run a generic FOF schedule.
% 2.68/1.15 % (4156699)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=449065914:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.68/1.15 % (4156699)First to succeed.
% 2.68/1.15 % (4156699)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4156690"
% 2.68/1.15 % (4156695)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3452828303:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.68/1.15 % (4156696)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4097725827:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.68/1.15 % (4156698)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4020652988:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.68/1.15 % (4156697)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1177336289:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.68/1.15 % (4156698)Also succeeded, but the first one will report.
% 2.68/1.15 % (4156700)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2478115237:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.68/1.15 % (4156701)dis-21_1_sil=8000:lcm=predicate:random_seed=2040400303:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.68/1.15 % (4156701)Also succeeded, but the first one will report.
% 2.68/1.15 % (4156700)Also succeeded, but the first one will report.
% 2.68/1.15 % (4156699)Refutation found. Thanks to Tanya!
% 2.68/1.15 % SZS status Theorem for theBenchmark
% 2.68/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 2.68/1.15 % (4156699)------------------------------
% 2.68/1.15 % (4156699)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.15 % (4156699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.15 % (4156699)CaDiCaL version: 2.1.3
% 2.68/1.15 % (4156699)Termination reason: Refutation
% 2.68/1.15 % (4156699)Time elapsed: 0.001 s
% 2.68/1.15 % (4156699)Peak memory usage: 88 MB
% 2.68/1.15 % (4156699)Instructions burned: 1 (million)
% 2.68/1.15 % (4156699)------------------------------
% 2.68/1.15 % (4156699)------------------------------
% 2.68/1.15 % (4156690)Success in time 0.292 s
% 2.68/1.15 % Vampire exiting
%------------------------------------------------------------------------------