↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWV905-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n008.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 : Thu Sep 24 03:07:06 PM UTC 2026

% Result   : Unsatisfiable 1.00s 0.73s
% Output   : CNFRefutation 1.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  12 unt;   2 nHn;  19 RR)
%            Number of literals    :   36 (   6 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   6 con; 0-3 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_MGF_0,axiom,
    ( ~ c_Hoare__Mirabelle_Ostate__not__singleton
    | ~ c_Com_OWT__bodies
    | ~ c_Com_OWT(X1)
    | c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_MGF_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(c_Com_Ocom_OBODY(v_x)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_Com_OWT__bodies,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_domIff_0,axiom,
    ( ~ hBOOL(c_in(X2,c_Map_Odom(X1,X4,X3),X4))
    | hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_domIff_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    hBOOL(c_in(v_x,c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),tc_Com_Opname)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_WT_OBody_0,axiom,
    ( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
    | c_Com_OWT(c_Com_Ocom_OBODY(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WT_OBody_0) ).

cnf(c_0_7,plain,
    ( ~ c_Hoare__Mirabelle_Ostate__not__singleton
    | ~ c_Com_OWT__bodies
    | ~ c_Com_OWT(X1)
    | c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
    inference(fof_simplification,[status(thm)],[cls_MGF_0]) ).

cnf(c_0_8,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(c_Com_Ocom_OBODY(v_x)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_9,plain,
    ( ~ c_Hoare__Mirabelle_Ostate__not__singleton
    | ~ c_Com_OWT__bodies
    | ~ c_Com_OWT(X1)
    | c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
    c_0_7 ).

cnf(c_0_10,negated_conjecture,
    c_Com_OWT__bodies,
    cls_conjecture_1 ).

cnf(c_0_11,negated_conjecture,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    cls_conjecture_0 ).

cnf(c_0_12,plain,
    ( ~ hBOOL(c_in(X2,c_Map_Odom(X1,X4,X3),X4))
    | hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
    inference(fof_simplification,[status(thm)],[cls_domIff_0]) ).

cnf(c_0_13,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(c_Com_Ocom_OBODY(v_x)),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate),
    c_0_8 ).

cnf(c_0_14,plain,
    ( ~ c_Com_OWT(X1)
    | c_Hoare__Mirabelle_Ohoare__derivs(c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),c_Set_Oinsert(c_Hoare__Mirabelle_OMGT(X1),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_bool)),tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),tc_Com_Ostate) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_15,plain,
    ( ~ hBOOL(c_in(X2,c_Map_Odom(X1,X4,X3),X4))
    | hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
    c_0_12 ).

cnf(c_0_16,negated_conjecture,
    hBOOL(c_in(v_x,c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom),tc_Com_Opname)),
    cls_conjecture_3 ).

cnf(c_0_17,negated_conjecture,
    ~ c_Com_OWT(c_Com_Ocom_OBODY(v_x)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,axiom,
    ( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
    | c_Com_OWT(c_Com_Ocom_OBODY(X1)) ),
    cls_WT_OBody_0 ).

cnf(c_0_19,negated_conjecture,
    c_Option_Ooption_ONone(tc_Com_Ocom) != hAPP(c_Com_Obody,v_x),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV905-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43  % Computer : n008.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Mon Sep 21 09:31:54 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50  Running first-order theorem proving
% 0.17/0.50  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.00/0.73  % Version: 3.5.1
% 1.00/0.73  % Preprocessing class: FSLSSLSMSSSNFFN.
% 1.00/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 1.00/0.73  % Starting new_bool_3 with 300s (1) cores
% 1.00/0.73  % Starting new_bool_1 with 300s (1) cores
% 1.00/0.73  % Starting sh5l with 300s (1) cores
% 1.00/0.73  % G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 677918 completed with status 0
% 1.00/0.73  % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 1.00/0.73  % Preprocessing class: FSLSSLSMSSSNFFN.
% 1.00/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 1.00/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.00/0.73  % No SInE strategy applied
% 1.00/0.73  % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.00/0.73  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.73  % Starting SubtermCWHack with 136s (1) cores
% 1.00/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 1.00/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 1.00/0.73  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 1.00/0.73  % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.00/0.73  % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 677928 completed with status 0
% 1.00/0.73  % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 1.00/0.73  % Preprocessing class: FSLSSLSMSSSNFFN.
% 1.00/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 1.00/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.00/0.73  % No SInE strategy applied
% 1.00/0.73  % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.00/0.73  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.73  % Starting SubtermCWHack with 136s (1) cores
% 1.00/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 1.00/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 1.00/0.73  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 1.00/0.73  % Preprocessing time       : 0.008 s
% 1.00/0.73  % Presaturation interreduction done
% 1.00/0.73  
% 1.00/0.73  % Proof found!
% 1.00/0.73  % SZS status Unsatisfiable
% 1.00/0.73  % SZS output start CNFRefutation
% See solution above
% 1.00/0.73  % Parsed axioms                        : 486
% 1.00/0.73  % Removed by relevancy pruning/SinE    : 0
% 1.00/0.73  % Initial clauses                      : 486
% 1.00/0.73  % Removed in clause preprocessing      : 3
% 1.00/0.73  % Initial clauses in saturation        : 483
% 1.00/0.73  % Processed clauses                    : 556
% 1.00/0.73  % ...of these trivial                  : 11
% 1.00/0.73  % ...subsumed                          : 68
% 1.00/0.73  % ...remaining for further processing  : 477
% 1.00/0.73  % Other redundant clauses eliminated   : 2
% 1.00/0.73  % Clauses deleted for lack of memory   : 0
% 1.00/0.73  % Backward-subsumed                    : 0
% 1.00/0.73  % Backward-rewritten                   : 2
% 1.00/0.73  % Generated clauses                    : 27
% 1.00/0.73  % ...of the previous two non-redundant : 19
% 1.00/0.73  % ...aggressively subsumed             : 0
% 1.00/0.73  % Contextual simplify-reflections      : 0
% 1.00/0.73  % Paramodulations                      : 23
% 1.00/0.73  % Factorizations                       : 0
% 1.00/0.73  % NegExts                              : 0
% 1.00/0.73  % Equation resolutions                 : 4
% 1.00/0.73  % Disequality decompositions           : 0
% 1.00/0.73  % Total rewrite steps                  : 35
% 1.00/0.73  % ...of those cached                   : 5
% 1.00/0.73  % Propositional unsat checks           : 0
% 1.00/0.73  %    Propositional check models        : 0
% 1.00/0.73  %    Propositional check unsatisfiable : 0
% 1.00/0.73  %    Propositional clauses             : 0
% 1.00/0.73  %    Propositional clauses after purity: 0
% 1.00/0.73  %    Propositional unsat core size     : 0
% 1.00/0.73  %    Propositional preprocessing time  : 0.000
% 1.00/0.73  %    Propositional encoding time       : 0.000
% 1.00/0.73  %    Propositional solver time         : 0.000
% 1.00/0.73  %    Success case prop preproc time    : 0.000
% 1.00/0.73  %    Success case prop encoding time   : 0.000
% 1.00/0.73  %    Success case prop solver time     : 0.000
% 1.00/0.73  % Current number of processed clauses  : 68
% 1.00/0.73  %    Positive orientable unit clauses  : 39
% 1.00/0.73  %    Positive unorientable unit clauses: 0
% 1.00/0.73  %    Negative unit clauses             : 10
% 1.00/0.73  %    Non-unit-clauses                  : 19
% 1.00/0.73  % Current number of unprocessed clauses: 351
% 1.00/0.73  % ...number of literals in the above   : 758
% 1.00/0.73  % Current number of archived formulas  : 0
% 1.00/0.73  % Current number of archived clauses   : 410
% 1.00/0.73  % Clause-clause subsumption calls (NU) : 12150
% 1.00/0.73  % Rec. Clause-clause subsumption calls : 9692
% 1.00/0.73  % Non-unit clause-clause subsumptions  : 51
% 1.00/0.73  % Unit Clause-clause subsumption calls : 77
% 1.00/0.73  % Rewrite failures with RHS unbound    : 0
% 1.00/0.73  % BW rewrite match attempts            : 91
% 1.00/0.73  % BW rewrite match successes           : 26
% 1.00/0.73  % Condensation attempts                : 0
% 1.00/0.73  % Condensation successes               : 0
% 1.00/0.73  % Termbank termtop insertions          : 20818
% 1.00/0.73  % Search garbage collected termcells   : 869
% 1.00/0.73  
% 1.00/0.73  % -------------------------------------------------
% 1.00/0.73  % User time                : 0.085 s
% 1.00/0.73  % System time              : 0.014 s
% 1.00/0.73  % Total time               : 0.099 s
% 1.00/0.73  % Maximum resident set size: 4532 pages
% 1.00/0.73  
% 1.00/0.73  % -------------------------------------------------
% 1.00/0.73  % User time                : 0.563 s
% 1.00/0.73  % System time              : 0.054 s
% 1.00/0.73  % Total time               : 0.617 s
% 1.00/0.73  % Maximum resident set size: 4864 pages
% 1.00/0.73  % E exiting
%------------------------------------------------------------------------------