↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV938-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 : 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:00:13 PM UTC 2026

% Result   : Unsatisfiable 5.32s 1.30s
% Output   : CNFRefutation 5.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  10 RR)
%            Number of literals    :   34 (   0 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-5 aty)
%            Number of functors    :   18 (  18 usr;  11 con; 0-5 aty)
%            Number of variables   :   64 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_wt__env__mono_0,axiom,
    ( ~ c_WellType_OWT(X1,X5,X3,X4)
    | ~ c_Map_Omap__le(X5,X2,tc_List_Olist(tc_String_Ochar),tc_Type_Oty)
    | c_WellType_OWT(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_wt__env__mono_0) ).

cnf(cls_map__le__upds_0,axiom,
    ( ~ c_Map_Omap__le(X1,X6,X4,X5)
    | c_Map_Omap__le(c_Map_Omap__upds(X1,X2,X3,X4,X5),c_Map_Omap__upds(X6,X2,X3,X4,X5),X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_map__le__upds_0) ).

cnf(cls_WT__implies__WTrt_0,axiom,
    ( ~ c_WellType_OWT(X1,X3,X4,X5)
    | c_WellTypeRT_OWTrt(X1,X2,X3,X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_WT__implies__WTrt_0) ).

cnf(cls_wtabody_0,axiom,
    c_WellType_OWT(v_P,c_Map_Omap__upds(c_COMBK(c_Option_Ooption_ONone(tc_Type_Oty),tc_Option_Ooption(tc_Type_Oty),tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_wtabody_0) ).

cnf(cls_map__le__empty_0,axiom,
    c_Map_Omap__le(c_COMBK(c_Option_Ooption_ONone(X1),tc_Option_Ooption(X1),X2),X3,X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_map__le__empty_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_WellTypeRT_OWTrt(v_P,v_ha____,c_Map_Omap__upds(v_E____,c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_6,plain,
    ( ~ c_WellType_OWT(X1,X5,X3,X4)
    | ~ c_Map_Omap__le(X5,X2,tc_List_Olist(tc_String_Ochar),tc_Type_Oty)
    | c_WellType_OWT(X1,X2,X3,X4) ),
    inference(fof_simplification,[status(thm)],[cls_wt__env__mono_0]) ).

cnf(c_0_7,plain,
    ( ~ c_Map_Omap__le(X1,X6,X4,X5)
    | c_Map_Omap__le(c_Map_Omap__upds(X1,X2,X3,X4,X5),c_Map_Omap__upds(X6,X2,X3,X4,X5),X4,X5) ),
    inference(fof_simplification,[status(thm)],[cls_map__le__upds_0]) ).

cnf(c_0_8,plain,
    ( ~ c_WellType_OWT(X1,X5,X3,X4)
    | ~ c_Map_Omap__le(X5,X2,tc_List_Olist(tc_String_Ochar),tc_Type_Oty)
    | c_WellType_OWT(X1,X2,X3,X4) ),
    c_0_6 ).

cnf(c_0_9,plain,
    ( ~ c_Map_Omap__le(X1,X6,X4,X5)
    | c_Map_Omap__le(c_Map_Omap__upds(X1,X2,X3,X4,X5),c_Map_Omap__upds(X6,X2,X3,X4,X5),X4,X5) ),
    c_0_7 ).

cnf(c_0_10,plain,
    ( ~ c_WellType_OWT(X1,X3,X4,X5)
    | c_WellTypeRT_OWTrt(X1,X2,X3,X4,X5) ),
    inference(fof_simplification,[status(thm)],[cls_WT__implies__WTrt_0]) ).

cnf(c_0_11,plain,
    ( ~ c_WellType_OWT(X1,c_Map_Omap__upds(X7,X3,X4,tc_List_Olist(tc_String_Ochar),tc_Type_Oty),X5,X6)
    | ~ c_Map_Omap__le(X7,X2,tc_List_Olist(tc_String_Ochar),tc_Type_Oty)
    | c_WellType_OWT(X1,c_Map_Omap__upds(X2,X3,X4,tc_List_Olist(tc_String_Ochar),tc_Type_Oty),X5,X6) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    c_WellType_OWT(v_P,c_Map_Omap__upds(c_COMBK(c_Option_Ooption_ONone(tc_Type_Oty),tc_Option_Ooption(tc_Type_Oty),tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    cls_wtabody_0 ).

cnf(c_0_13,axiom,
    c_Map_Omap__le(c_COMBK(c_Option_Ooption_ONone(X1),tc_Option_Ooption(X1),X2),X3,X2,X1),
    cls_map__le__empty_0 ).

cnf(c_0_14,negated_conjecture,
    ~ c_WellTypeRT_OWTrt(v_P,v_ha____,c_Map_Omap__upds(v_E____,c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_15,plain,
    ( ~ c_WellType_OWT(X1,X3,X4,X5)
    | c_WellTypeRT_OWTrt(X1,X2,X3,X4,X5) ),
    c_0_10 ).

cnf(c_0_16,plain,
    c_WellType_OWT(v_P,c_Map_Omap__upds(X1,c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_17,negated_conjecture,
    ~ c_WellTypeRT_OWTrt(v_P,v_ha____,c_Map_Omap__upds(v_E____,c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    c_0_14 ).

cnf(c_0_18,plain,
    c_WellTypeRT_OWTrt(v_P,X1,c_Map_Omap__upds(X2,c_List_Olist_OCons(c_Type_Othis,v_pns____,tc_List_Olist(tc_String_Ochar)),c_List_Olist_OCons(c_Type_Oty_OClass(v_D____),v_Ts____,tc_Type_Oty),tc_List_Olist(tc_String_Ochar),tc_Type_Oty),v_body____,v_T_H_H____),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV938-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44  % Computer : n008.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Mon Sep 21 09:34:23 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50  Running first-order theorem proving
% 0.18/0.50  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
% 5.32/1.30  % Version: 3.5.1
% 5.32/1.30  % Preprocessing class: FSLMSMSMSSSNFFN.
% 5.32/1.30  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.32/1.30  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 5.32/1.30  % Starting new_bool_3 with 600s (2) cores
% 5.32/1.30  % Starting new_bool_1 with 300s (1) cores
% 5.32/1.30  % Starting sh5l with 300s (1) cores
% 5.32/1.30  % new_bool_3 with pid 680743 completed with status 0
% 5.32/1.30  % Result found by new_bool_3
% 5.32/1.30  % Preprocessing class: FSLMSMSMSSSNFFN.
% 5.32/1.30  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.32/1.30  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 5.32/1.30  % Starting new_bool_3 with 600s (2) cores
% 5.32/1.30  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.32/1.30  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.32/1.30  % Search class: FGUSM-FSLM32-MFFFFFNN
% 5.32/1.30  % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 5.32/1.30  % Starting SubtermCWHack with 61s (1) cores
% 5.32/1.30  % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 5.32/1.30  % SAT001_MinMin_p005000_rr_RG with pid 680752 completed with status 0
% 5.32/1.30  % Result found by SAT001_MinMin_p005000_rr_RG
% 5.32/1.30  % Preprocessing class: FSLMSMSMSSSNFFN.
% 5.32/1.30  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.32/1.30  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 5.32/1.30  % Starting new_bool_3 with 600s (2) cores
% 5.32/1.30  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.32/1.30  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.32/1.30  % Search class: FGUSM-FSLM32-MFFFFFNN
% 5.32/1.30  % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 5.32/1.30  % Starting SubtermCWHack with 61s (1) cores
% 5.32/1.30  % Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 5.32/1.30  % Preprocessing time       : 0.007 s
% 5.32/1.30  % Presaturation interreduction done
% 5.32/1.30  
% 5.32/1.30  % Proof found!
% 5.32/1.30  % SZS status Unsatisfiable
% 5.32/1.30  % SZS output start CNFRefutation
% See solution above
% 5.32/1.30  % Parsed axioms                        : 501
% 5.32/1.30  % Removed by relevancy pruning/SinE    : 234
% 5.32/1.30  % Initial clauses                      : 267
% 5.32/1.30  % Removed in clause preprocessing      : 0
% 5.32/1.30  % Initial clauses in saturation        : 267
% 5.32/1.30  % Processed clauses                    : 4062
% 5.32/1.30  % ...of these trivial                  : 38
% 5.32/1.30  % ...subsumed                          : 2849
% 5.32/1.30  % ...remaining for further processing  : 1175
% 5.32/1.30  % Other redundant clauses eliminated   : 95
% 5.32/1.30  % Clauses deleted for lack of memory   : 0
% 5.32/1.30  % Backward-subsumed                    : 122
% 5.32/1.30  % Backward-rewritten                   : 15
% 5.32/1.30  % Generated clauses                    : 17217
% 5.32/1.30  % ...of the previous two non-redundant : 16196
% 5.32/1.30  % ...aggressively subsumed             : 0
% 5.32/1.30  % Contextual simplify-reflections      : 0
% 5.32/1.30  % Paramodulations                      : 17054
% 5.32/1.30  % Factorizations                       : 0
% 5.32/1.30  % NegExts                              : 0
% 5.32/1.30  % Equation resolutions                 : 163
% 5.32/1.30  % Disequality decompositions           : 0
% 5.32/1.30  % Total rewrite steps                  : 5609
% 5.32/1.30  % ...of those cached                   : 3387
% 5.32/1.30  % Propositional unsat checks           : 0
% 5.32/1.30  %    Propositional check models        : 0
% 5.32/1.30  %    Propositional check unsatisfiable : 0
% 5.32/1.30  %    Propositional clauses             : 0
% 5.32/1.30  %    Propositional clauses after purity: 0
% 5.32/1.30  %    Propositional unsat core size     : 0
% 5.32/1.30  %    Propositional preprocessing time  : 0.000
% 5.32/1.30  %    Propositional encoding time       : 0.000
% 5.32/1.30  %    Propositional solver time         : 0.000
% 5.32/1.30  %    Success case prop preproc time    : 0.000
% 5.32/1.30  %    Success case prop encoding time   : 0.000
% 5.32/1.30  %    Success case prop solver time     : 0.000
% 5.32/1.30  % Current number of processed clauses  : 851
% 5.32/1.30  %    Positive orientable unit clauses  : 74
% 5.32/1.30  %    Positive unorientable unit clauses: 10
% 5.32/1.30  %    Negative unit clauses             : 301
% 5.32/1.30  %    Non-unit-clauses                  : 466
% 5.32/1.30  % Current number of unprocessed clauses: 12418
% 5.32/1.30  % ...number of literals in the above   : 24845
% 5.32/1.30  % Current number of archived formulas  : 0
% 5.32/1.30  % Current number of archived clauses   : 324
% 5.32/1.30  % Clause-clause subsumption calls (NU) : 43093
% 5.32/1.30  % Rec. Clause-clause subsumption calls : 40057
% 5.32/1.30  % Non-unit clause-clause subsumptions  : 894
% 5.32/1.30  % Unit Clause-clause subsumption calls : 8839
% 5.32/1.30  % Rewrite failures with RHS unbound    : 0
% 5.32/1.30  % BW rewrite match attempts            : 166
% 5.32/1.30  % BW rewrite match successes           : 57
% 5.32/1.30  % Condensation attempts                : 0
% 5.32/1.30  % Condensation successes               : 0
% 5.32/1.30  % Termbank termtop insertions          : 214004
% 5.32/1.30  % Search garbage collected termcells   : 1564
% 5.32/1.30  
% 5.32/1.30  % -------------------------------------------------
% 5.32/1.30  % User time                : 0.683 s
% 5.32/1.30  % System time              : 0.035 s
% 5.32/1.30  % Total time               : 0.718 s
% 5.32/1.30  % Maximum resident set size: 4280 pages
% 5.32/1.30  
% 5.32/1.30  % -------------------------------------------------
% 5.32/1.30  % User time                : 1.386 s
% 5.32/1.30  % System time              : 0.077 s
% 5.32/1.30  % Total time               : 1.463 s
% 5.32/1.30  % Maximum resident set size: 5120 pages
% 5.32/1.30  % E exiting
%------------------------------------------------------------------------------