%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET072-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:39:57 PM UTC 2026
% Result : Unsatisfiable 3.50s 1.41s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 17 unt; 4 def)
% Number of atoms : 83 ( 18 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 30 ~; 32 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_member) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartesian_product1) ).
fof(f15,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartesian_product2) ).
fof(f101,negated_conjecture,
unordered_pair(x,z) = unordered_pair(y,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_right_cancellation_1) ).
fof(f102,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_right_cancellation_2) ).
fof(f103,negated_conjecture,
x != y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_right_cancellation_3) ).
fof(f104,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f105,plain,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(universal_class,universal_class)),
inference(definition_unfolding,[],[f102,f104]) ).
fof(f107,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X1,X3) ),
inference(definition_unfolding,[],[f15,f104]) ).
fof(f108,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X0,X2) ),
inference(definition_unfolding,[],[f14,f104]) ).
fof(f110,plain,
( member(y,unordered_pair(x,z))
| ~ member(y,universal_class) ),
inference(superposition,[],[f9,f101]) ).
fof(f112,definition,
( spl0_1
<=> member(y,universal_class) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f114,plain,
( ~ member(y,universal_class)
| spl0_1 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f116,definition,
( spl0_2
<=> member(y,unordered_pair(x,z)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f118,plain,
( member(y,unordered_pair(x,z))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f119,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f110,f116,f112]) ).
fof(f123,plain,
! [X0] :
( ~ member(X0,unordered_pair(x,z))
| y = X0
| z = X0 ),
inference(superposition,[],[f8,f101]) ).
fof(f124,plain,
( x = y
| x = z
| ~ member(x,universal_class) ),
inference(resolution,[],[f123,f9]) ).
fof(f126,plain,
( x = z
| ~ member(x,universal_class) ),
inference(forward_subsumption_resolution,[],[f124,f103]) ).
fof(f128,definition,
( spl0_3
<=> member(x,universal_class) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f130,plain,
( ~ member(x,universal_class)
| spl0_3 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f132,definition,
( spl0_4
<=> x = z ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f134,plain,
( x = z
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f132]) ).
fof(f135,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f126,f132,f128]) ).
fof(f136,plain,
member(y,universal_class),
inference(resolution,[],[f107,f105]) ).
fof(f137,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f136,f114]) ).
fof(f138,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f137]) ).
fof(f139,plain,
member(x,universal_class),
inference(resolution,[],[f108,f105]) ).
fof(f140,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f139,f130]) ).
fof(f141,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f147,plain,
( x = y
| z = y
| ~ spl0_2 ),
inference(resolution,[],[f118,f8]) ).
fof(f149,plain,
( z = y
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f147,f103]) ).
fof(f150,plain,
( x = y
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f149,f134]) ).
fof(f151,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f150,f103]) ).
fof(f152,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f151]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f119]) ).
cnf(s2,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f135]) ).
cnf(s3,plain,
spl0_1,
inference(sat_conversion,[],[f138]) ).
cnf(s4,plain,
spl0_3,
inference(sat_conversion,[],[f141]) ).
cnf(s5,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f152]) ).
cnf(s6,plain,
spl0_4,
inference(rat,[],[s2,s4]) ).
cnf(s7,plain,
~ spl0_2,
inference(rat,[],[s5,s6]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s7,s3]) ).
fof(f153,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET072-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 % Computer : n013.cluster.edu
% 0.11/0.41 % Model : x86_64 x86_64
% 0.11/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41 % Memory : 8046.5625MB
% 0.11/0.41 % OS : Linux 6.8.0-71-generic
% 0.11/0.41 % CPULimit : 300
% 0.11/0.41 % WCLimit : 300
% 0.11/0.41 % DateTime : Mon Sep 28 00:29:28 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.46 Running first-order theorem proving
% 0.11/0.46 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.50/1.41 % (701071)Input is clausal, will run a generic CNF schedule.
% 3.50/1.41 % (701077)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1723425260:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.50/1.41 % (701076)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=2793684587:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.50/1.41 % (701078)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=407984256:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.50/1.41 % (701082)dis-21_1_sil=8000:lcm=predicate:random_seed=3963030393:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.50/1.41 % (701080)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1374926143:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.50/1.41 % (701079)lrs+10_1_sil=8000:sp=occurrence:random_seed=3112719942:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.50/1.41 % (701079)First to succeed.
% 3.50/1.41 % (701079)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-701071"
% 3.50/1.41 % (701080)Also succeeded, but the first one will report.
% 3.50/1.41 % (701081)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3952538073:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.50/1.41 % (701081)Also succeeded, but the first one will report.
% 3.50/1.41 % (701082)Instruction limit reached!
% 3.50/1.41 % (701082)------------------------------
% 3.50/1.41 % (701082)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.41 % (701082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.41 % (701082)CaDiCaL version: 2.1.3
% 3.50/1.41 % (701082)Termination reason: Instruction limit
% 3.50/1.41 % (701082)Termination phase: Saturation
% 3.50/1.41 % (701082)Time elapsed: 0.065 s
% 3.50/1.41 % (701082)Peak memory usage: 88 MB
% 3.50/1.41 % (701082)Instructions burned: 119 (million)
% 3.50/1.41 % (701090)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3920324895:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.50/1.41 % (701090)Refutation not found, incomplete strategy
% 3.50/1.41 % (701090)------------------------------
% 3.50/1.41 % (701090)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.41 % (701090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.41 % (701090)CaDiCaL version: 2.1.3
% 3.50/1.41 % (701090)Termination reason: Refutation not found, incomplete strategy
% 3.50/1.41 % (701090)Time elapsed: 0.003 s
% 3.50/1.41 % (701090)Peak memory usage: 88 MB
% 3.50/1.41 % (701090)Instructions burned: 2 (million)
% 3.50/1.41 % (701079)Refutation found. Thanks to Tanya!
% 3.50/1.41 % SZS status Unsatisfiable for theBenchmark
% 3.50/1.41 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.41 % (701079)------------------------------
% 3.50/1.41 % (701079)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.41 % (701079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.41 % (701079)CaDiCaL version: 2.1.3
% 3.50/1.41 % (701079)Termination reason: Refutation
% 3.50/1.41 % (701079)Time elapsed: 0.004 s
% 3.50/1.41 % (701079)Peak memory usage: 89 MB
% 3.50/1.41 % (701079)Instructions burned: 3 (million)
% 3.50/1.41 % (701079)------------------------------
% 3.50/1.41 % (701079)------------------------------
% 3.50/1.41 % (701071)Success in time 0.421 s
% 3.50/1.41 % Vampire exiting
%------------------------------------------------------------------------------