%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC310-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:05:29 PM UTC 2026
% Result : Unsatisfiable 1.12s 0.57s
% Output : Refutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 34
% Syntax : Number of formulae : 135 ( 20 unt; 13 def)
% Number of atoms : 374 ( 77 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 443 ( 204 ~; 226 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 14 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f75,axiom,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
fof(f76,axiom,
! [X0] :
( ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f96,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| tl(cons(X0,X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
fof(f97,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| hd(cons(X0,X1)) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
fof(f125,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
fof(f126,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| cons(X0,X1) = app(cons(X0,nil),X1) ),
inference(reorient_equations,[],[f125]) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
( sk4 = app(cons(sk5,nil),sk6)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
( sk3 = app(sk6,cons(sk5,nil))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,negated_conjecture,
! [X2,X3,X0,X1] :
( nil = sk2
| ~ ssList(X0)
| sk1 != X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk2) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk2) != X3
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f219,plain,
( nil = sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f213,f204,f204]) ).
fof(f220,plain,
! [X2,X3,X0,X1] :
( nil = sk4
| ~ ssList(X0)
| sk3 != X0
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X1
| app(X1,X2) != X0
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(definition_unfolding,[],[f214,f204,f205,f204,f204,f204,f204]) ).
fof(f221,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f229,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f247,plain,
! [X2,X3,X1] :
( nil = sk4
| ~ ssList(sk3)
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X1
| app(X1,X2) != sk3
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f220]) ).
fof(f248,plain,
! [X2,X3] :
( nil = sk4
| ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(X2)
| sk3 != app(tl(sk4),X2)
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f247]) ).
fof(f249,plain,
! [X3] :
( nil = sk4
| ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(X3,nil))
| sk3 != app(tl(sk4),cons(X3,nil))
| ~ ssItem(X3)
| hd(sk4) != X3
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f248]) ).
fof(f250,plain,
( nil = sk4
| ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(nil,sk4) ),
inference(equality_resolution,[],[f249]) ).
fof(f256,plain,
( nil = sk4
| ~ ssList(sk3)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk3 != app(tl(sk4),cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4) ),
inference(duplicate_literal_removal,[],[f250]) ).
fof(f261,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f229]) ).
fof(f264,definition,
( spl0_1
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f266,plain,
( ~ neq(nil,sk4)
| spl0_1 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f268,definition,
( spl0_2
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f269,plain,
( ssItem(hd(sk4))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f270,plain,
( ~ ssItem(hd(sk4))
| spl0_2 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f272,definition,
( spl0_3
<=> sk3 = app(tl(sk4),cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f274,plain,
( sk3 != app(tl(sk4),cons(hd(sk4),nil))
| spl0_3 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f276,definition,
( spl0_4
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f278,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_4 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f280,definition,
( spl0_5
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f282,plain,
( ~ ssList(tl(sk4))
| spl0_5 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f284,definition,
( spl0_6
<=> ssList(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f286,plain,
( ~ ssList(sk3)
| spl0_6 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f288,definition,
( spl0_7
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f293,definition,
( spl0_8
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f295,plain,
( neq(sk4,nil)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f296,plain,
( spl0_8
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f221,f288,f293]) ).
fof(f298,definition,
( spl0_9
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f299,plain,
( nil != sk4
| spl0_9 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f300,plain,
( nil = sk4
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f301,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| spl0_9 ),
inference(avatar_split_clause,[],[f256,f298,f284,f280,f276,f272,f268,f264]) ).
fof(f302,plain,
( spl0_8
| spl0_9 ),
inference(avatar_split_clause,[],[f219,f298,f293]) ).
fof(f304,definition,
( spl0_10
<=> sk3 = app(sk6,cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f306,plain,
( sk3 = app(sk6,cons(sk5,nil))
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f307,plain,
( ~ spl0_8
| spl0_10 ),
inference(avatar_split_clause,[],[f212,f304,f293]) ).
fof(f309,definition,
( spl0_11
<=> sk4 = app(cons(sk5,nil),sk6) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f311,plain,
( sk4 = app(cons(sk5,nil),sk6)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f309]) ).
fof(f312,plain,
( ~ spl0_8
| spl0_11 ),
inference(avatar_split_clause,[],[f210,f309,f293]) ).
fof(f314,definition,
( spl0_12
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f316,plain,
( ssList(sk6)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f317,plain,
( ~ spl0_8
| spl0_12 ),
inference(avatar_split_clause,[],[f208,f314,f293]) ).
fof(f319,definition,
( spl0_13
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f321,plain,
( ssItem(sk5)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f319]) ).
fof(f322,plain,
( ~ spl0_8
| spl0_13 ),
inference(avatar_split_clause,[],[f207,f319,f293]) ).
fof(f323,plain,
( ~ spl0_9
| spl0_7 ),
inference(avatar_split_clause,[],[f206,f288,f298]) ).
fof(f417,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_2 ),
inference(resolution,[],[f76,f270]) ).
fof(f418,plain,
( nil = sk4
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f417,f203]) ).
fof(f419,plain,
( $false
| spl0_2
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f418,f299]) ).
fof(f420,plain,
( spl0_2
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f419]) ).
fof(f426,plain,
( neq(nil,nil)
| ~ spl0_8
| ~ spl0_9 ),
inference(superposition,[],[f295,f300]) ).
fof(f429,plain,
( ~ ssList(nil)
| ~ spl0_8
| ~ spl0_9 ),
inference(resolution,[],[f426,f261]) ).
fof(f431,plain,
( $false
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f429,f8]) ).
fof(f432,plain,
( ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f431]) ).
fof(f512,plain,
( ! [X0] :
( ~ ssList(X0)
| tl(cons(sk5,X0)) = X0 )
| ~ spl0_13 ),
inference(resolution,[],[f96,f321]) ).
fof(f541,plain,
( sk6 = tl(cons(sk5,sk6))
| ~ spl0_12
| ~ spl0_13 ),
inference(resolution,[],[f512,f316]) ).
fof(f636,plain,
( ! [X0] :
( ~ ssList(X0)
| sk5 = hd(cons(sk5,X0)) )
| ~ spl0_13 ),
inference(resolution,[],[f97,f321]) ).
fof(f672,plain,
( sk5 = hd(cons(sk5,sk6))
| ~ spl0_12
| ~ spl0_13 ),
inference(resolution,[],[f636,f316]) ).
fof(f724,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_1 ),
inference(resolution,[],[f102,f266]) ).
fof(f727,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f724,f8]) ).
fof(f728,plain,
( nil = sk4
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f727,f203]) ).
fof(f729,plain,
( $false
| spl0_1
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f728,f299]) ).
fof(f730,plain,
( spl0_1
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f729]) ).
fof(f731,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f286,f202]) ).
fof(f732,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f731]) ).
fof(f733,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_5 ),
inference(resolution,[],[f282,f75]) ).
fof(f734,plain,
( nil = sk4
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f733,f203]) ).
fof(f735,plain,
( $false
| spl0_5
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f734,f299]) ).
fof(f736,plain,
( spl0_5
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f735]) ).
fof(f743,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| spl0_4 ),
inference(resolution,[],[f278,f86]) ).
fof(f744,plain,
( ~ ssItem(hd(sk4))
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f743,f8]) ).
fof(f745,plain,
( $false
| ~ spl0_2
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f744,f269]) ).
fof(f746,plain,
( ~ spl0_2
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f745]) ).
fof(f3307,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(sk5,X0) = app(cons(sk5,nil),X0) )
| ~ spl0_13 ),
inference(resolution,[],[f126,f321]) ).
fof(f7286,plain,
( app(cons(sk5,nil),sk6) = cons(sk5,sk6)
| ~ spl0_12
| ~ spl0_13 ),
inference(resolution,[],[f3307,f316]) ).
fof(f7287,plain,
( sk4 = cons(sk5,sk6)
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_demodulation,[],[f7286,f311]) ).
fof(f7289,plain,
( sk5 = hd(sk4)
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(superposition,[],[f672,f7287]) ).
fof(f7290,plain,
( sk6 = tl(sk4)
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(superposition,[],[f541,f7287]) ).
fof(f7395,plain,
( sk3 != app(sk6,cons(hd(sk4),nil))
| spl0_3
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(superposition,[],[f274,f7290]) ).
fof(f7446,plain,
( sk3 != app(sk6,cons(sk5,nil))
| spl0_3
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_demodulation,[],[f7395,f7289]) ).
fof(f7447,plain,
( $false
| spl0_3
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f7446,f306]) ).
fof(f7448,plain,
( spl0_3
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(avatar_contradiction_clause,[],[f7447]) ).
cnf(s2,plain,
( ~ spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f296]) ).
cnf(s3,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| spl0_9 ),
inference(sat_conversion,[],[f301]) ).
cnf(s4,plain,
( spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f302]) ).
cnf(s5,plain,
( ~ spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f307]) ).
cnf(s6,plain,
( ~ spl0_8
| spl0_11 ),
inference(sat_conversion,[],[f312]) ).
cnf(s7,plain,
( ~ spl0_8
| spl0_12 ),
inference(sat_conversion,[],[f317]) ).
cnf(s8,plain,
( ~ spl0_8
| spl0_13 ),
inference(sat_conversion,[],[f322]) ).
cnf(s9,plain,
( spl0_7
| ~ spl0_9 ),
inference(sat_conversion,[],[f323]) ).
cnf(s18,plain,
( spl0_2
| spl0_9 ),
inference(sat_conversion,[],[f420]) ).
cnf(s19,plain,
( ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f432]) ).
cnf(s20,plain,
( spl0_1
| spl0_9 ),
inference(sat_conversion,[],[f730]) ).
cnf(s21,plain,
spl0_6,
inference(sat_conversion,[],[f732]) ).
cnf(s22,plain,
( spl0_5
| spl0_9 ),
inference(sat_conversion,[],[f736]) ).
cnf(s23,plain,
( ~ spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f746]) ).
cnf(s127,plain,
( spl0_3
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13 ),
inference(sat_conversion,[],[f7448]) ).
cnf(s134,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| spl0_9 ),
inference(rat,[],[s3,s21]) ).
cnf(s136,plain,
~ spl0_9,
inference(rat,[],[s2,s9,s19]) ).
cnf(s137,plain,
spl0_5,
inference(rat,[],[s22,s136]) ).
cnf(s138,plain,
spl0_1,
inference(rat,[],[s20,s136]) ).
cnf(s139,plain,
spl0_2,
inference(rat,[],[s18,s136]) ).
cnf(s140,plain,
spl0_8,
inference(rat,[],[s4,s136]) ).
cnf(s142,plain,
spl0_4,
inference(rat,[],[s23,s139]) ).
cnf(s143,plain,
spl0_13,
inference(rat,[],[s8,s140]) ).
cnf(s144,plain,
spl0_12,
inference(rat,[],[s7,s140]) ).
cnf(s145,plain,
spl0_11,
inference(rat,[],[s6,s140]) ).
cnf(s146,plain,
spl0_10,
inference(rat,[],[s5,s140]) ).
cnf(s149,plain,
~ spl0_3,
inference(rat,[],[s134,s136,s139,s137,s138,s142]) ).
cnf(s152,plain,
$false,
inference(rat,[],[s127,s143,s144,s145,s146,s149]) ).
fof(f7449,plain,
$false,
inference(avatar_sat_refutation,[],[s152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC310-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n016.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 09:05:33 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.12/0.57 % (3492972)Will run a generic schedule for satisfiability detection.
% 1.12/0.57 % (3492982)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2607063227:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.12/0.57 % (3492978)% WARNING: option uhcvi not known.
% 1.12/0.57 % (3492977)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3279346416_2999 on theBenchmark for (2999ds/0Mi)
% 1.12/0.57 % (3492978)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1349072842:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.12/0.57 % (3492979)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2418672940:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.12/0.57 % (3492980)dis+10_1_sil=32000:sp=arity:random_seed=2250594525:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.12/0.57 % (3492981)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4120607666:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.12/0.57 % (3492983)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3363468713:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.12/0.57 % TRYING [1]
% 1.12/0.57 % TRYING [2]
% 1.12/0.57 % TRYING [3]
% 1.12/0.57 % (3492982)Instruction limit reached!
% 1.12/0.57 % (3492982)------------------------------
% 1.12/0.57 % (3492982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492982)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492982)Termination reason: Instruction limit
% 1.12/0.57 % (3492982)Termination phase: Saturation
% 1.12/0.57 % (3492982)Time elapsed: 0.039 s
% 1.12/0.57 % (3492982)Peak memory usage: 14 MB
% 1.12/0.57 % (3492982)Instructions burned: 132 (million)
% 1.12/0.57 % TRYING [4]
% 1.12/0.57 % (3492991)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1493660487:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.12/0.57 % TRYING [1]
% 1.12/0.57 % TRYING [2]
% 1.12/0.57 % TRYING [3]
% 1.12/0.57 % (3492980)Instruction limit reached!
% 1.12/0.57 % (3492980)------------------------------
% 1.12/0.57 % (3492980)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492980)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492980)Termination reason: Instruction limit
% 1.12/0.57 % (3492980)Termination phase: Saturation
% 1.12/0.57 % (3492980)Time elapsed: 0.060 s
% 1.12/0.57 % (3492980)Peak memory usage: 13 MB
% 1.12/0.57 % (3492980)Instructions burned: 103 (million)
% 1.12/0.57 % (3492981)Instruction limit reached!
% 1.12/0.57 % (3492981)------------------------------
% 1.12/0.57 % (3492981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492981)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492981)Termination reason: Instruction limit
% 1.12/0.57 % (3492981)Termination phase: Saturation
% 1.12/0.57 % (3492981)Time elapsed: 0.061 s
% 1.12/0.57 % (3492981)Peak memory usage: 13 MB
% 1.12/0.57 % (3492981)Instructions burned: 116 (million)
% 1.12/0.57 % TRYING [4]
% 1.12/0.57 % (3492993)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3249685633:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.12/0.57 % (3492994)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1045245073:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.12/0.57 % (3492983)Instruction limit reached!
% 1.12/0.57 % (3492983)------------------------------
% 1.12/0.57 % (3492983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492983)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492983)Termination reason: Instruction limit
% 1.12/0.57 % (3492983)Termination phase: Saturation
% 1.12/0.57 % (3492983)Time elapsed: 0.095 s
% 1.12/0.57 % (3492983)Peak memory usage: 14 MB
% 1.12/0.57 % (3492983)Instructions burned: 159 (million)
% 1.12/0.57 % TRYING [5]
% 1.12/0.57 % TRYING [5]
% 1.12/0.57 % (3492997)ott-21_1_sil=16000:fs=off:random_seed=1535616043:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.12/0.57 % (3492993)Instruction limit reached!
% 1.12/0.57 % (3492993)------------------------------
% 1.12/0.57 % (3492993)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492993)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492993)Termination reason: Instruction limit
% 1.12/0.57 % (3492993)Termination phase: Saturation
% 1.12/0.57 % (3492993)Time elapsed: 0.069 s
% 1.12/0.57 % (3492993)Peak memory usage: 13 MB
% 1.12/0.57 % (3492993)Instructions burned: 133 (million)
% 1.12/0.57 % (3492999)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3546856204:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.12/0.57 % TRYING [6]
% 1.12/0.57 % (3492991)Instruction limit reached!
% 1.12/0.57 % (3492991)------------------------------
% 1.12/0.57 % (3492991)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492991)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492991)Termination reason: Instruction limit
% 1.12/0.57 % (3492991)Termination phase: Finite model building constraint generation
% 1.12/0.57 % (3492991)Time elapsed: 0.150 s
% 1.12/0.57 % (3492991)Peak memory usage: 34 MB
% 1.12/0.57 % (3492991)Instructions burned: 722 (million)
% 1.12/0.57 % (3493001)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3609617615:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.12/0.57 % (3492997)Instruction limit reached!
% 1.12/0.57 % (3492997)------------------------------
% 1.12/0.57 % (3492997)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.57 % (3492997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.57 % (3492997)CaDiCaL version: 2.1.3
% 1.12/0.57 % (3492997)Termination reason: Instruction limit
% 1.12/0.57 % (3492997)Termination phase: Saturation
% 1.12/0.57 % (3492997)Time elapsed: 0.089 s
% 1.12/0.57 % (3492997)Peak memory usage: 13 MB
% 1.12/0.57 % (3492997)Instructions burned: 180 (million)
% 1.12/0.57 % TRYING [1]
% 1.12/0.57 % TRYING [2]
% 1.12/0.57 % TRYING [3]
% 1.12/0.57 % (3493003)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1070630047:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.12/0.57 % TRYING [4]
% 1.12/0.57 % TRYING [6]
% 1.12/0.57 % (3492994) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3492972-3492994"...
% 1.12/0.57 % TRYING [5]
% 1.12/0.57 % (3492994)...printing done.
% 1.12/0.57 % (3492994)Refutation found. Thanks to Tanya!
% 1.12/0.57 % SZS status Unsatisfiable for theBenchmark
% 1.12/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.12/0.58 % (3492994)------------------------------
% 1.12/0.58 % (3492994)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.58 % (3492994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.58 % (3492994)CaDiCaL version: 2.1.3
% 1.12/0.58 % (3492994)Termination reason: Refutation
% 1.12/0.58 % (3492994)Time elapsed: 0.213 s
% 1.12/0.58 % (3492994)Peak memory usage: 16 MB
% 1.12/0.58 % (3492994)Instructions burned: 332 (million)
% 1.12/0.58 % (3492972)Success in time 0.339 s
% 1.12/0.58 % Vampire exiting
%------------------------------------------------------------------------------