%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM011-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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 09:40:07 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 32 ( 10 unt; 2 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 49 ( 23 ~; 24 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,negated_conjecture,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f4,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_minus(X1,X2,tc_set(X3)),X3)
| c_in(X0,X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_ODiffE_1) ).
fof(f5,axiom,
! [X2,X0,X1] :
( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ c_in(X0,c_UNITY_Oconstrains(X1,X2,X3),tc_UNITY_Oprogram(X3))
| ~ c_lessequals(X4,X1,tc_set(X3))
| c_in(X0,c_UNITY_Oconstrains(X4,X2,X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_UNITY_Oconstrains__weaken__L_0) ).
fof(f8,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_UNITY_Oconstrains(c_minus(X1,X2,tc_set(X3)),c_union(X1,X2,X3),X3),tc_UNITY_Oprogram(X3))
| ~ c_in(X0,c_WFair_Otransient(c_minus(X1,X2,tc_set(X3)),X3),tc_UNITY_Oprogram(X3))
| c_in(X0,c_WFair_Oensures(X1,X2,X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_OensuresI_0) ).
fof(f9,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_WFair_Oensures(X1,X2,X3),tc_UNITY_Oprogram(X3))
| c_in(X0,c_WFair_OleadsTo(X1,X2,X3),tc_UNITY_Oprogram(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_OleadsTo__Basis_0) ).
fof(f10,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_WFair_Otransient(X1,X2),tc_UNITY_Oprogram(X2))
| ~ c_lessequals(X3,X1,tc_set(X2))
| c_in(X0,c_WFair_Otransient(X3,X2),tc_UNITY_Oprogram(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_Otransient__strengthen_0) ).
fof(f11,plain,
! [X2,X3,X0,X1] :
( c_in(c_Main_OsubsetI__1(c_minus(X0,X1,tc_set(X2)),X3,X2),X0,X2)
| c_lessequals(c_minus(X0,X1,tc_set(X2)),X3,tc_set(X2)) ),
inference(resolution,[],[f5,f4]) ).
fof(f15,plain,
! [X0] :
( c_in(v_F,c_WFair_Otransient(X0,t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X0,v_A,tc_set(t_a)) ),
inference(resolution,[],[f10,f2]) ).
fof(f17,plain,
! [X0] :
( c_in(v_F,c_UNITY_Oconstrains(X0,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))
| ~ c_lessequals(X0,v_A,tc_set(t_a)) ),
inference(resolution,[],[f7,f1]) ).
fof(f22,plain,
( ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))
| ~ c_in(v_F,c_WFair_Otransient(c_minus(v_A,v_B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
| c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(resolution,[],[f17,f8]) ).
fof(f23,plain,
( ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))
| c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(forward_subsumption_resolution,[],[f22,f15]) ).
fof(f25,definition,
( spl0_1
<=> c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f27,plain,
( c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f29,definition,
( spl0_2
<=> c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f31,plain,
( ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a))
| spl0_2 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f32,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f23,f29,f25]) ).
fof(f33,plain,
! [X2,X0,X1] :
( c_lessequals(c_minus(X0,X1,tc_set(X2)),X0,tc_set(X2))
| c_lessequals(c_minus(X0,X1,tc_set(X2)),X0,tc_set(X2)) ),
inference(resolution,[],[f11,f6]) ).
fof(f39,plain,
! [X2,X0,X1] : c_lessequals(c_minus(X0,X1,tc_set(X2)),X0,tc_set(X2)),
inference(duplicate_literal_removal,[],[f33]) ).
fof(f51,plain,
( $false
| spl0_2 ),
inference(resolution,[],[f39,f31]) ).
fof(f54,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f51]) ).
fof(f55,plain,
( c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a))
| ~ spl0_1 ),
inference(resolution,[],[f27,f9]) ).
fof(f56,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f55,f3]) ).
fof(f57,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f56]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f32]) ).
cnf(s2,plain,
spl0_2,
inference(sat_conversion,[],[f54]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f57]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f58,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM011-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n003.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 21:46:43 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.20/0.28 % (2064870)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (2064878)dis+10_1_sil=32000:sp=arity:random_seed=3348113407:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (2064878) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2064870-2064878"...
% 0.20/0.28 % (2064878)...printing done.
% 0.20/0.28 % (2064878)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (2064878)------------------------------
% 0.20/0.28 % (2064878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2064878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2064878)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2064878)Termination reason: Refutation
% 0.20/0.28 % (2064878)Time elapsed: 0.001 s
% 0.20/0.28 % (2064878)Peak memory usage: 11 MB
% 0.20/0.28 % (2064878)Instructions burned: 2 (million)
% 0.20/0.28 % (2064870)Success in time 0.041 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------