TSTP Solution File: KRS014-1 by SnakeForV-SAT---1.0

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : KRS014-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 17:30:36 EDT 2022

% Result   : Satisfiable 1.29s 0.54s
% Output   : Saturation 1.29s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u52,negated_conjecture,
    ( equalish(u2r1(u2r2(exists),X2,X3),u2r3(exists))
    | s2exact(X3)
    | ~ s(X3,X2)
    | equalish(u2r2(exists),X2)
    | ~ s(exists,u2r1(u2r2(exists),X2,X3))
    | ~ s(X3,u2r2(exists)) ) ).

cnf(u50,negated_conjecture,
    ( equalish(u2r1(X2,u2r2(exists),X3),u2r3(exists))
    | ~ s(X3,X2)
    | s2exact(X3)
    | ~ s(X3,u2r2(exists))
    | equalish(X2,u2r2(exists))
    | ~ s(exists,u2r1(X2,u2r2(exists),X3)) ) ).

cnf(u42,negated_conjecture,
    equalish(u2r3(exists),u2r3(exists)) ).

cnf(u40,negated_conjecture,
    ( equalish(u1r1(u2r2(exists),X0),u2r3(exists))
    | ~ r(X0,u2r2(exists))
    | ~ s(exists,u1r1(u2r2(exists),X0))
    | r1exact(X0) ) ).

cnf(u38,negated_conjecture,
    ( equalish(X0,u2r2(exists))
    | equalish(X0,u2r3(exists))
    | ~ s(exists,X0) ) ).

cnf(u29,negated_conjecture,
    ( equalish(X0,u1r2(exists))
    | ~ r(exists,X0) ) ).

cnf(clause_17,axiom,
    ( ~ equalish(u2r1(X2,X1,X0),X2)
    | equalish(X2,X1)
    | ~ s(X0,X2)
    | s2exact(X0)
    | ~ s(X0,X1) ) ).

cnf(clause_16,axiom,
    ( ~ equalish(u2r1(X2,X1,X0),X1)
    | equalish(X2,X1)
    | ~ s(X0,X2)
    | s2exact(X0)
    | ~ s(X0,X1) ) ).

cnf(clause_10,axiom,
    ( ~ equalish(u1r1(X1,X0),X1)
    | ~ r(X0,X1)
    | r1exact(X0) ) ).

cnf(clause_13,axiom,
    ( ~ equalish(u2r3(X0),u2r2(X0))
    | ~ s2exact(X0) ) ).

cnf(u35,negated_conjecture,
    r1exact(exists) ).

cnf(clause_5,axiom,
    ( r1exact(X0)
    | ~ e(X0) ) ).

cnf(clause_9,axiom,
    ( ~ r1exact(X0)
    | r(X0,u1r2(X0)) ) ).

cnf(clause_8,axiom,
    ( ~ r1exact(X0)
    | equalish(X2,u1r2(X0))
    | ~ r(X0,X2) ) ).

cnf(clause_6,axiom,
    ( ~ r1exact(X0)
    | r(X0,u0r1(X0))
    | e(X0)
    | s(X0,u0r1(X0))
    | ~ s2exact(X0) ) ).

cnf(clause_7,axiom,
    ( ~ r1exact(X0)
    | ~ s(X0,u0r1(X0))
    | ~ s2exact(X0)
    | e(X0)
    | ~ r(X0,u0r1(X0)) ) ).

cnf(u19,negated_conjecture,
    s2exact(exists) ).

cnf(clause_14,axiom,
    ( ~ s2exact(X0)
    | s(X0,u2r2(X0)) ) ).

cnf(clause_15,axiom,
    ( ~ s2exact(X0)
    | s(X0,u2r3(X0)) ) ).

cnf(clause_12,axiom,
    ( ~ s2exact(X0)
    | ~ s(X0,X3)
    | equalish(X3,u2r3(X0))
    | equalish(X3,u2r2(X0)) ) ).

cnf(clause_11,axiom,
    ( r(X0,u1r1(X1,X0))
    | r1exact(X0)
    | ~ r(X0,X1) ) ).

cnf(u27,negated_conjecture,
    ( r(exists,X0)
    | ~ s(exists,X0) ) ).

cnf(u21,negated_conjecture,
    r(exists,u1r2(exists)) ).

cnf(u51,negated_conjecture,
    ( ~ r(exists,u2r1(u1r2(exists),X0,X1))
    | ~ s(X1,u1r2(exists))
    | equalish(u1r2(exists),X0)
    | s2exact(X1)
    | ~ s(X1,X0) ) ).

cnf(u49,negated_conjecture,
    ( ~ r(exists,u2r1(X0,u1r2(exists),X1))
    | equalish(X0,u1r2(exists))
    | ~ s(X1,u1r2(exists))
    | ~ s(X1,X0)
    | s2exact(X1) ) ).

cnf(u30,negated_conjecture,
    ( ~ r(exists,u1r1(u1r2(exists),X0))
    | ~ r(X0,u1r2(exists))
    | r1exact(X0) ) ).

cnf(u22,negated_conjecture,
    ( ~ r(exists,X0)
    | s(exists,X0) ) ).

cnf(clause_18,axiom,
    ( s(X0,u2r1(X2,X1,X0))
    | s2exact(X0)
    | equalish(X2,X1)
    | ~ s(X0,X1)
    | ~ s(X0,X2) ) ).

cnf(u23,negated_conjecture,
    s(exists,u2r2(exists)) ).

cnf(u25,negated_conjecture,
    s(exists,u2r3(exists)) ).

cnf(u33,negated_conjecture,
    ( s(exists,u1r1(X0,exists))
    | r1exact(exists)
    | ~ r(exists,X0) ) ).

cnf(u24,negated_conjecture,
    s(exists,u1r2(exists)) ).

cnf(u58,negated_conjecture,
    ( ~ s(exists,u2r1(u2r2(exists),u2r3(exists),X0))
    | ~ s(X0,u2r2(exists))
    | ~ s(X0,u2r3(exists))
    | s2exact(X0)
    | equalish(u2r2(exists),u2r3(exists)) ) ).

cnf(u55,negated_conjecture,
    ( ~ s(exists,u2r1(u2r3(exists),u2r2(exists),X0))
    | ~ s(X0,u2r2(exists))
    | equalish(u2r3(exists),u2r2(exists))
    | ~ s(X0,u2r3(exists))
    | s2exact(X0) ) ).

cnf(u56,negated_conjecture,
    ( ~ s(exists,u2r1(u1r2(exists),X1,X0))
    | ~ s(X0,u1r2(exists))
    | equalish(u1r2(exists),X1)
    | ~ s(X0,X1)
    | s2exact(X0) ) ).

cnf(u53,negated_conjecture,
    ( ~ s(exists,u2r1(X0,u1r2(exists),X1))
    | equalish(X0,u1r2(exists))
    | ~ s(X1,u1r2(exists))
    | ~ s(X1,X0)
    | s2exact(X1) ) ).

cnf(u31,negated_conjecture,
    ( ~ s(exists,u1r1(u1r2(exists),X0))
    | ~ r(X0,u1r2(exists))
    | r1exact(X0) ) ).

cnf(clause_1,negated_conjecture,
    e(exists) ).

cnf(clause_4,axiom,
    ( ~ e(X0)
    | s2exact(X0) ) ).

cnf(u20,axiom,
    ( ~ e(X0)
    | r(X0,u1r2(X0)) ) ).

cnf(clause_2,axiom,
    ( ~ e(X0)
    | s(X0,X1)
    | ~ r(X0,X1) ) ).

cnf(clause_3,axiom,
    ( ~ e(X0)
    | ~ s(X0,X1)
    | r(X0,X1) ) ).

cnf(u26,axiom,
    ( ~ e(X1)
    | equalish(X0,u1r2(X1))
    | ~ r(X1,X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KRS014-1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 00:33:48 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 1.29/0.52  % (8041)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.29/0.53  % (8040)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.29/0.53  % (8035)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.29/0.53  % (8035)First to succeed.
% 1.29/0.53  % (8056)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 1.29/0.53  % (8043)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.29/0.54  % SZS status Satisfiable for theBenchmark
% 1.29/0.54  % (8035)# SZS output start Saturation.
% See solution above
% 1.29/0.54  % (8035)------------------------------
% 1.29/0.54  % (8035)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.54  % (8035)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.54  % (8035)Termination reason: Satisfiable
% 1.29/0.54  
% 1.29/0.54  % (8035)Memory used [KB]: 895
% 1.29/0.54  % (8035)Time elapsed: 0.116 s
% 1.29/0.54  % (8035)Instructions burned: 3 (million)
% 1.29/0.54  % (8035)------------------------------
% 1.29/0.54  % (8035)------------------------------
% 1.29/0.54  % (8032)Success in time 0.177 s
%------------------------------------------------------------------------------