%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWX228-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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 01:46:47 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.32s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 31 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 13 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-4 aty)
% Number of variables : 54 ( 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : aux(X0,X1,X2,btrue) = union(X2,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).
fof(f3,axiom,
! [X0] : barbar(btrue,X0) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
fof(f4,plain,
! [X0] : btrue = barbar(btrue,X0),
inference(reorient_equations,[],[f3]) ).
fof(f11,axiom,
eqNat(z,z) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
fof(f12,plain,
btrue = eqNat(z,z),
inference(reorient_equations,[],[f11]) ).
fof(f15,axiom,
! [X2,X0,X1] : elem(X0,cons(X1,X2)) = barbar(eqNat(X0,X1),elem(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).
fof(f16,axiom,
! [X0] : union(nil,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).
fof(f17,axiom,
! [X2,X0,X1] : union(cons(X0,X1),X2) = aux(X2,X0,X1,elem(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
fof(f18,axiom,
! [X0,X1] : prop_union_comm(X0,X1) = eq(union(X0,X1),union(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
fof(f30,axiom,
! [X0] : eq2(X0,X0) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
fof(f31,plain,
! [X0] : btrue = eq2(X0,X0),
inference(reorient_equations,[],[f30]) ).
fof(f32,axiom,
! [X0] : eq3(X0,X0) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
fof(f33,plain,
! [X0] : btrue = eq3(X0,X0),
inference(reorient_equations,[],[f32]) ).
fof(f36,axiom,
! [X2,X3,X0,X1] :
( eq2(X0,X1) != btrue
| eq(cons(X0,X2),cons(X1,X3)) = eq(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_022) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( btrue != eq2(X0,X1)
| eq(cons(X0,X2),cons(X1,X3)) = eq(X2,X3) ),
inference(reorient_equations,[],[f36]) ).
fof(f40,axiom,
! [X0,X1] : eq(cons(X0,X1),nil) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_024) ).
fof(f41,plain,
! [X0,X1] : bfalse = eq(cons(X0,X1),nil),
inference(reorient_equations,[],[f40]) ).
fof(f42,negated_conjecture,
! [X0,X1] : eq3(prop_union_comm(X0,X1),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
fof(f43,plain,
! [X0,X1] : btrue != eq3(prop_union_comm(X0,X1),bfalse),
inference(reorient_equations,[],[f42]) ).
fof(f44,plain,
! [X0,X1] : btrue != eq3(eq(union(X0,X1),union(X1,X0)),bfalse),
inference(definition_unfolding,[],[f43,f18]) ).
fof(f54,plain,
! [X0] : elem(z,cons(z,X0)) = barbar(btrue,elem(z,X0)),
inference(superposition,[],[f15,f12]) ).
fof(f61,plain,
! [X0] : btrue = elem(z,cons(z,X0)),
inference(forward_demodulation,[],[f54,f4]) ).
fof(f71,plain,
! [X0,X1] : union(cons(z,X0),cons(z,X1)) = aux(cons(z,X1),z,X0,btrue),
inference(superposition,[],[f17,f61]) ).
fof(f73,plain,
! [X0,X1] : union(cons(z,X0),cons(z,X1)) = union(X0,cons(z,X1)),
inference(forward_demodulation,[],[f71,f1]) ).
fof(f74,plain,
! [X2,X0,X1] :
( btrue != btrue
| eq(cons(X0,X1),cons(X0,X2)) = eq(X1,X2) ),
inference(superposition,[],[f37,f31]) ).
fof(f78,plain,
! [X2,X0,X1] : eq(cons(X0,X1),cons(X0,X2)) = eq(X1,X2),
inference(trivial_inequality_removal,[],[f74]) ).
fof(f157,plain,
! [X0,X1] : btrue != eq3(eq(union(X0,cons(z,X1)),union(cons(z,X1),cons(z,X0))),bfalse),
inference(superposition,[],[f44,f73]) ).
fof(f158,plain,
! [X0,X1] : btrue != eq3(eq(union(X0,cons(z,X1)),union(X1,cons(z,X0))),bfalse),
inference(forward_demodulation,[],[f157,f73]) ).
fof(f160,plain,
! [X0] : btrue != eq3(eq(cons(z,X0),union(X0,cons(z,nil))),bfalse),
inference(superposition,[],[f158,f16]) ).
fof(f173,plain,
! [X0] : btrue != eq3(eq(cons(z,cons(z,X0)),union(X0,cons(z,nil))),bfalse),
inference(superposition,[],[f160,f73]) ).
fof(f314,plain,
btrue != eq3(eq(cons(z,cons(z,nil)),cons(z,nil)),bfalse),
inference(superposition,[],[f173,f16]) ).
fof(f316,plain,
btrue != eq3(eq(cons(z,nil),nil),bfalse),
inference(forward_demodulation,[],[f314,f78]) ).
fof(f317,plain,
btrue != eq3(bfalse,bfalse),
inference(forward_demodulation,[],[f316,f41]) ).
fof(f318,plain,
$false,
inference(forward_subsumption_resolution,[],[f317,f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX228-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 % Computer : n026.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Mon Sep 28 15:16:11 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.27 Running first-order model finding
% 0.09/0.27 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.27/0.32 % (3929350)Will run a generic schedule for satisfiability detection.
% 0.27/0.32 % (3929356)% WARNING: option uhcvi not known.
% 0.27/0.32 % (3929356)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2760707012:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.27/0.32 % (3929355)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1305353577_2999 on theBenchmark for (2999ds/0Mi)
% 0.27/0.32 % TRYING [1]
% 0.27/0.32 % TRYING [2]
% 0.27/0.32 % TRYING [3]
% 0.27/0.32 % (3929356) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3929350-3929356"...
% 0.27/0.32 % (3929356)...printing done.
% 0.27/0.32 % (3929356)Refutation found. Thanks to Tanya!
% 0.27/0.32 % SZS status Unsatisfiable for theBenchmark
% 0.27/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.32 % (3929356)------------------------------
% 0.27/0.32 % (3929356)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.32 % (3929356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.32 % (3929356)CaDiCaL version: 2.1.3
% 0.27/0.32 % (3929356)Termination reason: Refutation
% 0.27/0.32 % (3929356)Time elapsed: 0.011 s
% 0.27/0.32 % (3929356)Peak memory usage: 12 MB
% 0.27/0.32 % (3929356)Instructions burned: 19 (million)
% 0.27/0.32 % (3929350)Success in time 0.033 s
% 0.27/0.32 % Vampire exiting
%------------------------------------------------------------------------------