↑ 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  : SWV906-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.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 0.15s 10.55s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (  14 unt;   2 nHn;  20 RR)
%            Number of literals    :   36 (   9 equ;  19 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   8 con; 0-3 aty)
%            Number of variables   :   15 (   4 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(hAPP(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/sandbox2/benchmark/theBenchmark.p',cls_MGF_0) ).

cnf(cls_not__Some__eq_1,axiom,
    c_Option_Ooption_ONone(X1) != c_Option_Ooption_OSome(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_not__Some__eq_1) ).

cnf(cls_conjecture_5,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(hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,v_pn)),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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

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

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

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

cnf(cls_conjecture_3,negated_conjecture,
    hAPP(c_Com_Obody,v_pn) = c_Option_Ooption_OSome(v_y,tc_Com_Ocom),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

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(hAPP(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,plain,
    c_Option_Ooption_ONone(X1) != c_Option_Ooption_OSome(X2,X1),
    inference(fof_simplification,[status(thm)],[cls_not__Some__eq_1]) ).

cnf(c_0_9,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(hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,v_pn)),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_5]) ).

cnf(c_0_10,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(hAPP(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_11,negated_conjecture,
    c_Hoare__Mirabelle_Ostate__not__singleton,
    cls_conjecture_0 ).

cnf(c_0_12,negated_conjecture,
    c_Com_OWT__bodies,
    cls_conjecture_1 ).

cnf(c_0_13,plain,
    c_Option_Ooption_ONone(X1) != c_Option_Ooption_OSome(X2,X1),
    c_0_8 ).

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

cnf(c_0_15,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(hAPP(c_Hoare__Mirabelle_OMGT,hAPP(c_Com_Ocom_OBODY,v_pn)),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_9 ).

cnf(c_0_16,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(hAPP(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_10,c_0_11]),c_0_12])]) ).

cnf(c_0_17,plain,
    ( hAPP(c_Com_Obody,X1) != c_Option_Ooption_OSome(X2,tc_Com_Ocom)
    | c_Com_OWT(hAPP(c_Com_Ocom_OBODY,X1)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    hAPP(c_Com_Obody,v_pn) = c_Option_Ooption_OSome(v_y,tc_Com_Ocom),
    cls_conjecture_3 ).

cnf(c_0_19,negated_conjecture,
    ~ c_Com_OWT(hAPP(c_Com_Ocom_OBODY,v_pn)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( hAPP(c_Com_Obody,X1) != hAPP(c_Com_Obody,v_pn)
    | c_Com_OWT(hAPP(c_Com_Ocom_OBODY,X1)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV906-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/10.38  % Computer : n001.cluster.edu
% 0.12/10.38  % Model    : x86_64 x86_64
% 0.12/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.38  % Memory   : 8046.5625MB
% 0.12/10.38  % OS       : Linux 6.8.0-71-generic
% 0.12/10.38  % CPULimit : 300
% 0.12/10.38  % WCLimit  : 300
% 0.12/10.38  % DateTime : Mon Sep 21 09:36:54 UTC 2026
% 0.12/10.38  % CPUTime  : 
% 0.12/10.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43  Running first-order theorem proving
% 0.15/10.43  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/10.54  % Version: 3.5.1
% 0.15/10.54  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.15/10.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.54  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.15/10.54  % Starting new_bool_3 with 300s (1) cores
% 0.15/10.54  % Starting new_bool_1 with 300s (1) cores
% 0.15/10.54  % Starting sh5l with 300s (1) cores
% 0.15/10.54  % new_bool_3 with pid 2798468 completed with status 0
% 0.15/10.54  % Result found by new_bool_3
% 0.15/10.54  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.15/10.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.54  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.15/10.54  % Starting new_bool_3 with 300s (1) cores
% 0.15/10.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.54  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.15/10.54  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.54  % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.54  % SubtermCWHack with pid 2798471 completed with status 0
% 0.15/10.54  % Result found by SubtermCWHack
% 0.15/10.55  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.15/10.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.55  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.15/10.55  % Starting new_bool_3 with 300s (1) cores
% 0.15/10.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.55  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.55  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.15/10.55  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.55  % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.55  % Preprocessing time       : 0.005 s
% 0.15/10.55  
% 0.15/10.55  % Proof found!
% 0.15/10.55  % SZS status Unsatisfiable
% 0.15/10.55  % SZS output start CNFRefutation
% See solution above
% 0.15/10.55  % Parsed axioms                        : 514
% 0.15/10.55  % Removed by relevancy pruning/SinE    : 156
% 0.15/10.55  % Initial clauses                      : 358
% 0.15/10.55  % Removed in clause preprocessing      : 0
% 0.15/10.55  % Initial clauses in saturation        : 358
% 0.15/10.55  % Processed clauses                    : 1101
% 0.15/10.55  % ...of these trivial                  : 83
% 0.15/10.55  % ...subsumed                          : 573
% 0.15/10.55  % ...remaining for further processing  : 445
% 0.15/10.55  % Other redundant clauses eliminated   : 22
% 0.15/10.55  % Clauses deleted for lack of memory   : 0
% 0.15/10.55  % Backward-subsumed                    : 1
% 0.15/10.55  % Backward-rewritten                   : 6
% 0.15/10.55  % Generated clauses                    : 4476
% 0.15/10.55  % ...of the previous two non-redundant : 2709
% 0.15/10.55  % ...aggressively subsumed             : 0
% 0.15/10.55  % Contextual simplify-reflections      : 0
% 0.15/10.55  % Paramodulations                      : 4426
% 0.15/10.55  % Factorizations                       : 2
% 0.15/10.55  % NegExts                              : 0
% 0.15/10.55  % Equation resolutions                 : 48
% 0.15/10.55  % Disequality decompositions           : 0
% 0.15/10.55  % Total rewrite steps                  : 2442
% 0.15/10.55  % ...of those cached                   : 1550
% 0.15/10.55  % Propositional unsat checks           : 0
% 0.15/10.55  %    Propositional check models        : 0
% 0.15/10.55  %    Propositional check unsatisfiable : 0
% 0.15/10.55  %    Propositional clauses             : 0
% 0.15/10.55  %    Propositional clauses after purity: 0
% 0.15/10.55  %    Propositional unsat core size     : 0
% 0.15/10.55  %    Propositional preprocessing time  : 0.000
% 0.15/10.55  %    Propositional encoding time       : 0.000
% 0.15/10.55  %    Propositional solver time         : 0.000
% 0.15/10.55  %    Success case prop preproc time    : 0.000
% 0.15/10.55  %    Success case prop encoding time   : 0.000
% 0.15/10.55  %    Success case prop solver time     : 0.000
% 0.15/10.55  % Current number of processed clauses  : 436
% 0.15/10.55  %    Positive orientable unit clauses  : 157
% 0.15/10.55  %    Positive unorientable unit clauses: 5
% 0.15/10.55  %    Negative unit clauses             : 44
% 0.15/10.55  %    Non-unit-clauses                  : 230
% 0.15/10.55  % Current number of unprocessed clauses: 1957
% 0.15/10.55  % ...number of literals in the above   : 4144
% 0.15/10.55  % Current number of archived formulas  : 0
% 0.15/10.55  % Current number of archived clauses   : 7
% 0.15/10.55  % Clause-clause subsumption calls (NU) : 20805
% 0.15/10.55  % Rec. Clause-clause subsumption calls : 17767
% 0.15/10.55  % Non-unit clause-clause subsumptions  : 410
% 0.15/10.55  % Unit Clause-clause subsumption calls : 559
% 0.15/10.55  % Rewrite failures with RHS unbound    : 0
% 0.15/10.55  % BW rewrite match attempts            : 194
% 0.15/10.55  % BW rewrite match successes           : 32
% 0.15/10.55  % Condensation attempts                : 0
% 0.15/10.55  % Condensation successes               : 0
% 0.15/10.55  % Termbank termtop insertions          : 64953
% 0.15/10.55  % Search garbage collected termcells   : 1274
% 0.15/10.55  
% 0.15/10.55  % -------------------------------------------------
% 0.15/10.55  % User time                : 0.081 s
% 0.15/10.55  % System time              : 0.016 s
% 0.15/10.55  % Total time               : 0.098 s
% 0.15/10.55  % Maximum resident set size: 4536 pages
% 0.15/10.55  
% 0.15/10.55  % -------------------------------------------------
% 0.15/10.55  % User time                : 0.089 s
% 0.15/10.55  % System time              : 0.018 s
% 0.15/10.55  % Total time               : 0.107 s
% 0.15/10.55  % Maximum resident set size: 5120 pages
% 0.15/10.55  % E exiting
%------------------------------------------------------------------------------