%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET117+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:43:10 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 12 unt; 0 def)
% Number of atoms : 18 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(f44,conjecture,
! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
=> member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_1_to_ordered_pairs_are_sets) ).
fof(f45,negated_conjecture,
~ ! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
=> member(X0,universal_class) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f60,plain,
? [X0] :
( ~ member(X0,universal_class)
& ordered_pair(first(X0),second(X0)) = X0 ),
inference(ennf_transformation,[],[f45]) ).
fof(f72,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f73,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f74,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f7]) ).
fof(f148,plain,
sK6 = ordered_pair(first(sK6),second(sK6)),
inference(cnf_transformation,[],[f60]) ).
fof(f149,plain,
~ member(sK6,universal_class),
inference(cnf_transformation,[],[f60]) ).
fof(f150,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f74,f73,f73]) ).
fof(f187,plain,
sK6 = unordered_pair(unordered_pair(first(sK6),first(sK6)),unordered_pair(first(sK6),unordered_pair(second(sK6),second(sK6)))),
inference(definition_unfolding,[],[f148,f150]) ).
fof(f194,plain,
member(sK6,universal_class),
inference(superposition,[],[f72,f187]) ).
fof(f195,plain,
$false,
inference(forward_subsumption_resolution,[],[f194,f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET117+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 00:46:10 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.45 % (1929695)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1929704)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1827044768:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (1929701)% WARNING: option uhcvi not known.
% 0.10/0.45 % (1929704) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1929695-1929704"...
% 0.10/0.45 % (1929704)...printing done.
% 0.10/0.45 % (1929704)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (1929704)------------------------------
% 0.10/0.45 % (1929704)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1929704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1929704)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1929704)Termination reason: Refutation
% 0.10/0.45 % (1929704)Time elapsed: 0.003 s
% 0.10/0.45 % (1929704)Peak memory usage: 12 MB
% 0.10/0.45 % (1929704)Instructions burned: 7 (million)
% 0.10/0.45 % (1929695)Success in time 0.029 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------