%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC031-1 : TPTP v9.3.1. Released v2.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 01:04:22 PM UTC 2026
% Result : Unsatisfiable 1.12s 0.60s
% Output : Refutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 33
% Syntax : Number of formulae : 127 ( 19 unt; 10 def)
% Number of atoms : 401 ( 41 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 517 ( 243 ~; 264 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 11 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 108 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f12,axiom,
! [X0] : ssItem(skaf83(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
fof(f13,axiom,
! [X0] : ssList(skaf82(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
fof(f60,axiom,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
fof(f67,axiom,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause67) ).
fof(f72,axiom,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f84,axiom,
! [X0] :
( ~ frontsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f112,axiom,
! [X0] :
( ~ ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
fof(f192,axiom,
! [X2,X3,X0,X1] :
( ~ frontsegP(X0,X1)
| X2 != X3
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X2)
| frontsegP(cons(X2,X0),cons(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
fof(f193,axiom,
! [X2,X3,X0,X1,X4] :
( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(X4)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f208,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ segmentP(X0,sk3)
| ~ totalorderedP(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f212,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
( nil = sk4
| nil = sk3 ),
inference(definition_unfolding,[],[f209,f204,f205]) ).
fof(f218,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f212,f205,f204]) ).
fof(f235,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(equality_resolution,[],[f192]) ).
fof(f236,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(equality_resolution,[],[f193]) ).
fof(f249,plain,
! [X0] : ~ ssItem(skaf83(X0)),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f272,plain,
! [X0] :
( ssItem(X0)
| ~ totalorderedP(cons(X0,nil)) ),
inference(consistent_polarity_flipping,[],[f67]) ).
fof(f277,plain,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ~ ssItem(X1) ),
inference(consistent_polarity_flipping,[],[f72]) ).
fof(f282,plain,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f289,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ssItem(X0)
| ~ ssList(X1) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f291,plain,
! [X0,X1] :
( ~ neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f344,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ssItem(X3)
| ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(consistent_polarity_flipping,[],[f235]) ).
fof(f345,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(consistent_polarity_flipping,[],[f236]) ).
fof(f353,plain,
! [X0] :
( ~ ssList(X0)
| neq(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ segmentP(X0,sk3)
| totalorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f208]) ).
fof(f354,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(duplicate_literal_removal,[],[f344]) ).
fof(f361,definition,
( spl0_1
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f362,plain,
( nil = sk4
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f361]) ).
fof(f363,plain,
( nil != sk4
| spl0_1 ),
inference(avatar_component_clause,[],[f361]) ).
fof(f365,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f366,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f365]) ).
fof(f367,plain,
( nil != sk3
| spl0_2 ),
inference(avatar_component_clause,[],[f365]) ).
fof(f368,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f218,f365,f361]) ).
fof(f369,plain,
( spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f215,f361,f365]) ).
fof(f375,definition,
( spl0_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f376,plain,
( ssList(nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f380,definition,
( spl0_5
<=> ! [X1] :
( ssItem(X1)
| ~ totalorderedP(cons(X1,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f381,plain,
( ! [X1] :
( ~ totalorderedP(cons(X1,nil))
| ssItem(X1) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f380]) ).
fof(f403,definition,
( spl0_10
<=> ! [X1] : ~ ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f404,plain,
( ! [X1] : ~ ssItem(X1)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f406,definition,
( spl0_11
<=> ! [X0] :
( ~ ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f407,plain,
( ! [X0] :
( duplicatefreeP(X0)
| ~ ssList(X0) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f406]) ).
fof(f408,plain,
( spl0_10
| spl0_11 ),
inference(avatar_split_clause,[],[f277,f406,f403]) ).
fof(f409,plain,
spl0_5,
inference(avatar_split_clause,[],[f272,f380]) ).
fof(f411,plain,
spl0_4,
inference(avatar_split_clause,[],[f8,f375]) ).
fof(f416,plain,
( ! [X0] :
( neq(nil,X0)
| ~ ssList(X0)
| ~ frontsegP(sk4,X0)
| ~ segmentP(X0,sk3)
| totalorderedP(X0) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f353,f366]) ).
fof(f417,plain,
( ! [X0] :
( ~ frontsegP(sk4,X0)
| neq(nil,X0)
| ~ ssList(X0)
| ~ segmentP(X0,nil)
| totalorderedP(X0) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f416,f366]) ).
fof(f428,plain,
( frontsegP(nil,sk3)
| ~ spl0_1 ),
inference(superposition,[],[f206,f362]) ).
fof(f473,plain,
( ! [X1] : ~ totalorderedP(cons(X1,nil))
| ~ spl0_5
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f381,f404]) ).
fof(f544,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_1 ),
inference(resolution,[],[f84,f428]) ).
fof(f550,plain,
( nil = sk3
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f544,f202]) ).
fof(f551,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f550,f367]) ).
fof(f552,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f551]) ).
fof(f553,plain,
( ! [X0] :
( neq(nil,X0)
| ~ frontsegP(sk4,X0)
| ~ ssList(X0)
| totalorderedP(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f417,f56]) ).
fof(f579,plain,
( ! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f282,f404]) ).
fof(f590,plain,
( ! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssList(X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f289,f404]) ).
fof(f668,plain,
( ! [X0] :
( ~ ssList(nil)
| ~ ssList(X0)
| nil = X0
| ~ frontsegP(sk4,X0)
| ~ ssList(X0)
| totalorderedP(X0) )
| ~ spl0_2 ),
inference(resolution,[],[f291,f553]) ).
fof(f669,plain,
( ! [X0] :
( ~ ssList(nil)
| ~ ssList(X0)
| nil = X0
| ~ frontsegP(sk4,X0)
| totalorderedP(X0) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f668]) ).
fof(f672,plain,
( ! [X0] :
( ~ frontsegP(sk4,X0)
| nil = X0
| ~ ssList(X0)
| totalorderedP(X0) )
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f669,f376]) ).
fof(f774,plain,
( sk4 = cons(skaf83(sk4),skaf82(sk4))
| nil = sk4 ),
inference(resolution,[],[f112,f203]) ).
fof(f775,plain,
( sk4 = cons(skaf83(sk4),skaf82(sk4))
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f774,f363]) ).
fof(f1887,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X0)
| ssItem(X1)
| frontsegP(cons(X1,X0),cons(X1,nil))
| ~ ssList(X0) ),
inference(resolution,[],[f354,f60]) ).
fof(f1896,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X0)
| ssItem(X1)
| frontsegP(cons(X1,X0),cons(X1,nil)) ),
inference(duplicate_literal_removal,[],[f1887]) ).
fof(f1901,plain,
( ! [X0,X1] :
( frontsegP(cons(X1,X0),cons(X1,nil))
| ssItem(X1)
| ~ ssList(X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f1896,f376]) ).
fof(f2231,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X0)
| ssItem(X1)
| ~ ssList(X3) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f345,f407]) ).
fof(f2247,definition,
( spl0_45
<=> ! [X3] : ~ ssList(X3) ),
introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).
fof(f2248,plain,
( ! [X3] : ~ ssList(X3)
| ~ spl0_45 ),
inference(avatar_component_clause,[],[f2247]) ).
fof(f2250,definition,
( spl0_46
<=> ! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X1,cons(X2,X0)))
| ssItem(X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_46])],[avatar_definition]) ).
fof(f2251,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(X1,cons(X2,X0)))
| ~ ssList(X1)
| ~ ssList(X0)
| ssItem(X2) )
| ~ spl0_46 ),
inference(avatar_component_clause,[],[f2250]) ).
fof(f3576,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssItem(X2)
| ~ ssList(X3)
| ~ ssList(app(X1,cons(X2,X0)))
| ~ ssList(cons(X2,X3)) )
| ~ spl0_11 ),
inference(resolution,[],[f2231,f85]) ).
fof(f3585,plain,
( ! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssItem(X2)
| ~ ssList(X3)
| ~ ssList(app(X1,cons(X2,X0))) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f3576,f282]) ).
fof(f4380,plain,
( $false
| ~ spl0_45 ),
inference(backward_subsumption_resolution,[],[f203,f2248]) ).
fof(f4413,plain,
~ spl0_45,
inference(avatar_contradiction_clause,[],[f4380]) ).
fof(f9403,plain,
( frontsegP(sk4,cons(skaf83(sk4),nil))
| ssItem(skaf83(sk4))
| ~ ssList(skaf82(sk4))
| spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f1901,f775]) ).
fof(f9406,plain,
( frontsegP(sk4,cons(skaf83(sk4),nil))
| ~ ssList(skaf82(sk4))
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f9403,f249]) ).
fof(f9413,plain,
( frontsegP(sk4,cons(skaf83(sk4),nil))
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f9406,f13]) ).
fof(f9895,plain,
( ! [X0] :
( ~ ssList(app(X0,sk4))
| ~ ssList(X0)
| ~ ssList(skaf82(sk4))
| ssItem(skaf83(sk4)) )
| spl0_1
| ~ spl0_46 ),
inference(superposition,[],[f2251,f775]) ).
fof(f9897,plain,
( ! [X0] :
( ~ ssList(app(X0,sk4))
| ~ ssList(X0)
| ssItem(skaf83(sk4)) )
| spl0_1
| ~ spl0_46 ),
inference(forward_subsumption_resolution,[],[f9895,f13]) ).
fof(f9900,plain,
( ! [X0] :
( ~ ssList(app(X0,sk4))
| ~ ssList(X0) )
| spl0_1
| ~ spl0_46 ),
inference(forward_subsumption_resolution,[],[f9897,f249]) ).
fof(f10172,plain,
( nil = cons(skaf83(sk4),nil)
| ~ ssList(cons(skaf83(sk4),nil))
| totalorderedP(cons(skaf83(sk4),nil))
| spl0_1
| ~ spl0_2
| ~ spl0_4 ),
inference(resolution,[],[f9413,f672]) ).
fof(f10181,plain,
( nil = cons(skaf83(sk4),nil)
| ~ ssList(cons(skaf83(sk4),nil))
| spl0_1
| ~ spl0_2
| ~ spl0_4
| ~ spl0_5
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f10172,f473]) ).
fof(f10187,definition,
( spl0_176
<=> ssList(cons(skaf83(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_176])],[avatar_definition]) ).
fof(f10189,plain,
( ~ ssList(cons(skaf83(sk4),nil))
| spl0_176 ),
inference(avatar_component_clause,[],[f10187]) ).
fof(f10209,definition,
( spl0_181
<=> nil = cons(skaf83(sk4),nil) ),
introduced(definition,[new_symbols(definition,[spl0_181])],[avatar_definition]) ).
fof(f10211,plain,
( nil = cons(skaf83(sk4),nil)
| ~ spl0_181 ),
inference(avatar_component_clause,[],[f10209]) ).
fof(f10245,plain,
( ~ ssList(nil)
| ~ spl0_10
| spl0_176 ),
inference(resolution,[],[f10189,f579]) ).
fof(f10246,plain,
( $false
| ~ spl0_4
| ~ spl0_10
| spl0_176 ),
inference(forward_subsumption_resolution,[],[f10245,f376]) ).
fof(f10247,plain,
( ~ spl0_4
| ~ spl0_10
| spl0_176 ),
inference(avatar_contradiction_clause,[],[f10246]) ).
fof(f10448,plain,
( spl0_45
| spl0_46
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f3585,f406,f2250,f2247]) ).
fof(f10533,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(X0)
| ~ ssList(sk4) )
| spl0_1
| ~ spl0_46 ),
inference(resolution,[],[f9900,f85]) ).
fof(f10536,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(sk4) )
| spl0_1
| ~ spl0_46 ),
inference(duplicate_literal_removal,[],[f10533]) ).
fof(f10539,plain,
( ! [X0] : ~ ssList(X0)
| spl0_1
| ~ spl0_46 ),
inference(forward_subsumption_resolution,[],[f10536,f203]) ).
fof(f10546,plain,
( spl0_45
| spl0_1
| ~ spl0_46 ),
inference(avatar_split_clause,[],[f10539,f2250,f361,f2247]) ).
fof(f10623,plain,
( ~ spl0_176
| spl0_181
| spl0_1
| ~ spl0_2
| ~ spl0_4
| ~ spl0_5
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f10181,f403,f380,f375,f365,f361,f10209,f10187]) ).
fof(f10847,plain,
( nil != nil
| ~ ssList(nil)
| ~ spl0_10
| ~ spl0_181 ),
inference(superposition,[],[f590,f10211]) ).
fof(f10849,plain,
( ~ ssList(nil)
| ~ spl0_10
| ~ spl0_181 ),
inference(trivial_inequality_removal,[],[f10847]) ).
fof(f10850,plain,
( $false
| ~ spl0_4
| ~ spl0_10
| ~ spl0_181 ),
inference(forward_subsumption_resolution,[],[f10849,f376]) ).
fof(f10851,plain,
( ~ spl0_4
| ~ spl0_10
| ~ spl0_181 ),
inference(avatar_contradiction_clause,[],[f10850]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f368]) ).
cnf(s2,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f369]) ).
cnf(s9,plain,
( spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f408]) ).
cnf(s10,plain,
spl0_5,
inference(sat_conversion,[],[f409]) ).
cnf(s12,plain,
spl0_4,
inference(sat_conversion,[],[f411]) ).
cnf(s19,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f552]) ).
cnf(s115,plain,
~ spl0_45,
inference(sat_conversion,[],[f4413]) ).
cnf(s301,plain,
( ~ spl0_4
| ~ spl0_10
| spl0_176 ),
inference(sat_conversion,[],[f10247]) ).
cnf(s318,plain,
( ~ spl0_11
| spl0_45
| spl0_46 ),
inference(sat_conversion,[],[f10448]) ).
cnf(s334,plain,
( spl0_1
| spl0_45
| ~ spl0_46 ),
inference(sat_conversion,[],[f10546]) ).
cnf(s335,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_4
| ~ spl0_5
| ~ spl0_10
| ~ spl0_176
| spl0_181 ),
inference(sat_conversion,[],[f10623]) ).
cnf(s362,plain,
( ~ spl0_4
| ~ spl0_10
| ~ spl0_181 ),
inference(sat_conversion,[],[f10851]) ).
cnf(s410,plain,
spl0_1,
inference(rat,[],[s335,s301,s362,s9,s318,s2,s334,s12,s10,s115]) ).
cnf(s411,plain,
spl0_2,
inference(rat,[],[s19,s410]) ).
cnf(s413,plain,
$false,
inference(rat,[],[s1,s411,s410]) ).
fof(f10852,plain,
$false,
inference(avatar_sat_refutation,[],[s413]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC031-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 07:29:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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
% 1.12/0.60 % (2221814)Will run a generic schedule for satisfiability detection.
% 1.12/0.60 % (2221819)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=198395580_2999 on theBenchmark for (2999ds/0Mi)
% 1.12/0.60 % (2221825)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2029872574:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.12/0.60 % (2221822)dis+10_1_sil=32000:sp=arity:random_seed=503949243:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.12/0.60 % (2221821)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=978036612:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.12/0.60 % (2221823)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=704348128:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.12/0.60 % (2221824)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1196390493:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.12/0.60 % (2221820)% WARNING: option uhcvi not known.
% 1.12/0.60 % (2221820)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=765744078:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.12/0.60 % TRYING [1]
% 1.12/0.60 % TRYING [2]
% 1.12/0.60 % TRYING [3]
% 1.12/0.60 % TRYING [4]
% 1.12/0.60 % (2221822)Instruction limit reached!
% 1.12/0.60 % (2221822)------------------------------
% 1.12/0.60 % (2221822)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.60 % (2221822)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.60 % (2221822)CaDiCaL version: 2.1.3
% 1.12/0.60 % (2221822)Termination reason: Instruction limit
% 1.12/0.60 % (2221822)Termination phase: Saturation
% 1.12/0.60 % (2221822)Time elapsed: 0.059 s
% 1.12/0.60 % (2221822)Peak memory usage: 13 MB
% 1.12/0.60 % (2221822)Instructions burned: 104 (million)
% 1.12/0.60 % (2221823)Instruction limit reached!
% 1.12/0.60 % (2221823)------------------------------
% 1.12/0.60 % (2221823)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.60 % (2221823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.60 % (2221823)CaDiCaL version: 2.1.3
% 1.12/0.60 % (2221823)Termination reason: Instruction limit
% 1.12/0.60 % (2221823)Termination phase: Saturation
% 1.12/0.60 % (2221823)Time elapsed: 0.060 s
% 1.12/0.60 % (2221823)Peak memory usage: 13 MB
% 1.12/0.60 % (2221823)Instructions burned: 116 (million)
% 1.12/0.60 % (2221824)Instruction limit reached!
% 1.12/0.60 % (2221824)------------------------------
% 1.12/0.60 % (2221824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.60 % (2221824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.60 % (2221824)CaDiCaL version: 2.1.3
% 1.12/0.60 % (2221824)Termination reason: Instruction limit
% 1.12/0.60 % (2221824)Termination phase: Saturation
% 1.12/0.60 % (2221824)Time elapsed: 0.066 s
% 1.12/0.60 % (2221824)Peak memory usage: 14 MB
% 1.12/0.60 % (2221824)Instructions burned: 131 (million)
% 1.12/0.60 % (2221834)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4058657233:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.12/0.60 % (2221833)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2870750126:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.12/0.60 % (2221835)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=1087227164:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.12/0.60 % TRYING [1]
% 1.12/0.60 % TRYING [2]
% 1.12/0.60 % (2221825)Instruction limit reached!
% 1.12/0.60 % (2221825)------------------------------
% 1.12/0.60 % (2221825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.60 % (2221825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.60 % (2221825)CaDiCaL version: 2.1.3
% 1.12/0.60 % (2221825)Termination reason: Instruction limit
% 1.12/0.60 % (2221825)Termination phase: Saturation
% 1.12/0.60 % (2221825)Time elapsed: 0.096 s
% 1.12/0.60 % (2221825)Peak memory usage: 14 MB
% 1.12/0.60 % (2221825)Instructions burned: 160 (million)
% 1.12/0.60 % TRYING [3]
% 1.12/0.60 % TRYING [5]
% 1.12/0.60 % (2221839)ott-21_1_sil=16000:fs=off:random_seed=1376196122:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.12/0.60 % TRYING [4]
% 1.12/0.60 % (2221820) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2221814-2221820"...
% 1.12/0.60 % (2221820)...printing done.
% 1.12/0.60 % (2221820)Refutation found. Thanks to Tanya!
% 1.12/0.60 % SZS status Unsatisfiable for theBenchmark
% 1.12/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.12/0.60 % (2221820)------------------------------
% 1.12/0.60 % (2221820)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.12/0.60 % (2221820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.12/0.60 % (2221820)CaDiCaL version: 2.1.3
% 1.12/0.60 % (2221820)Termination reason: Refutation
% 1.12/0.60 % (2221820)Time elapsed: 0.144 s
% 1.12/0.60 % (2221820)Peak memory usage: 17 MB
% 1.12/0.60 % (2221820)Instructions burned: 440 (million)
% 1.12/0.60 % (2221814)Success in time 0.185 s
% 1.12/0.60 % Vampire exiting
%------------------------------------------------------------------------------