↑ 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  : SWV892-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 : n003.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:05 PM UTC 2026

% Result   : Unsatisfiable 0.35s 0.73s
% Output   : CNFRefutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (  11 unt;   4 nHn;  22 RR)
%            Number of literals    :   49 (  20 equ;  24 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :   35 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_WT__bodiesD_0,axiom,
    ( ~ c_Com_OWT__bodies
    | hAPP(c_Com_Obody,X1) != c_Option_Ooption_OSome(X2,tc_Com_Ocom)
    | c_Com_OWT(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WT__bodiesD_0) ).

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

cnf(cls_WTs__elim__cases_I7_J_0,axiom,
    ( ~ c_Com_OWT(c_Com_Ocom_OBODY(X1))
    | hAPP(c_Com_Obody,X1) = c_Option_Ooption_OSome(c_Com_Osko__Com__XWTs__elim__cases__7__1(X1),tc_Com_Ocom) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WTs__elim__cases_I7_J_0) ).

cnf(cls_the_Osimps_0,axiom,
    c_Option_Othe(c_Option_Ooption_OSome(X1,X2),X2) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_the_Osimps_0) ).

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(cls_domIff_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X4),X2),c_Map_Odom(X1,X4,X3)))
    | hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_domIff_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_Com_OWT(c_Option_Othe(hAPP(c_Com_Obody,v_pn),tc_Com_Ocom)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

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

cnf(c_0_8,plain,
    ( ~ c_Com_OWT__bodies
    | hAPP(c_Com_Obody,X1) != c_Option_Ooption_OSome(X2,tc_Com_Ocom)
    | c_Com_OWT(X2) ),
    inference(fof_simplification,[status(thm)],[cls_WT__bodiesD_0]) ).

cnf(c_0_9,plain,
    ( ~ c_Com_OWT__bodies
    | hAPP(c_Com_Obody,X1) != c_Option_Ooption_OSome(X2,tc_Com_Ocom)
    | c_Com_OWT(X2) ),
    c_0_8 ).

cnf(c_0_10,negated_conjecture,
    c_Com_OWT__bodies,
    cls_conjecture_1 ).

cnf(c_0_11,plain,
    ( ~ c_Com_OWT(c_Com_Ocom_OBODY(X1))
    | hAPP(c_Com_Obody,X1) = c_Option_Ooption_OSome(c_Com_Osko__Com__XWTs__elim__cases__7__1(X1),tc_Com_Ocom) ),
    inference(fof_simplification,[status(thm)],[cls_WTs__elim__cases_I7_J_0]) ).

cnf(c_0_12,plain,
    ( hAPP(c_Com_Obody,X2) != c_Option_Ooption_OSome(X1,tc_Com_Ocom)
    | c_Com_OWT(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_13,plain,
    ( ~ c_Com_OWT(c_Com_Ocom_OBODY(X1))
    | hAPP(c_Com_Obody,X1) = c_Option_Ooption_OSome(c_Com_Osko__Com__XWTs__elim__cases__7__1(X1),tc_Com_Ocom) ),
    c_0_11 ).

cnf(c_0_14,axiom,
    c_Option_Othe(c_Option_Ooption_OSome(X1,X2),X2) = X1,
    cls_the_Osimps_0 ).

cnf(c_0_15,plain,
    ( ~ c_Com_OWT(c_Com_Ocom_OBODY(X1))
    | hAPP(c_Com_Obody,X2) != hAPP(c_Com_Obody,X1)
    | c_Com_OWT(c_Com_Osko__Com__XWTs__elim__cases__7__1(X1)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    ( ~ c_Com_OWT(c_Com_Ocom_OBODY(X1))
    | c_Com_Osko__Com__XWTs__elim__cases__7__1(X1) = c_Option_Othe(hAPP(c_Com_Obody,X1),tc_Com_Ocom) ),
    inference(spm,[status(thm)],[c_0_14,c_0_13]) ).

cnf(c_0_17,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_18,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X4),X2),c_Map_Odom(X1,X4,X3)))
    | hAPP(X1,X2) != c_Option_Ooption_ONone(X3) ),
    inference(fof_simplification,[status(thm)],[cls_domIff_0]) ).

cnf(c_0_19,negated_conjecture,
    ~ c_Com_OWT(c_Option_Othe(hAPP(c_Com_Obody,v_pn),tc_Com_Ocom)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_20,plain,
    ( ~ c_Com_OWT(c_Com_Ocom_OBODY(X1))
    | c_Com_OWT(c_Com_Osko__Com__XWTs__elim__cases__7__1(X1)) ),
    inference(er,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    ( hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom)
    | c_Com_Osko__Com__XWTs__elim__cases__7__1(X1) = c_Option_Othe(hAPP(c_Com_Obody,X1),tc_Com_Ocom) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

cnf(c_0_23,negated_conjecture,
    hBOOL(hAPP(hAPP(c_in(tc_Com_Opname),v_pn),c_Map_Odom(c_Com_Obody,tc_Com_Opname,tc_Com_Ocom))),
    cls_conjecture_3 ).

cnf(c_0_24,negated_conjecture,
    ~ c_Com_OWT(c_Option_Othe(hAPP(c_Com_Obody,v_pn),tc_Com_Ocom)),
    c_0_19 ).

cnf(c_0_25,plain,
    ( c_Com_OWT(c_Option_Othe(hAPP(c_Com_Obody,X1),tc_Com_Ocom))
    | hAPP(c_Com_Obody,X1) = c_Option_Ooption_ONone(tc_Com_Ocom) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).

cnf(c_0_26,negated_conjecture,
    c_Option_Ooption_ONone(tc_Com_Ocom) != hAPP(c_Com_Obody,v_pn),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV892-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.18/0.44  % Computer : n003.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:32:00 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.50  Running first-order theorem proving
% 0.18/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
% 0.35/0.73  % Version: 3.5.1
% 0.35/0.73  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.35/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.35/0.73  % Starting new_bool_3 with 300s (1) cores
% 0.35/0.73  % Starting new_bool_1 with 300s (1) cores
% 0.35/0.73  % Starting sh5l with 300s (1) cores
% 0.35/0.73  % G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 3961626 completed with status 0
% 0.35/0.73  % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 0.35/0.73  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.35/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.35/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.35/0.73  % No SInE strategy applied
% 0.35/0.73  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.35/0.73  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.73  % Starting SubtermCWHack with 136s (1) cores
% 0.35/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.35/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 0.35/0.73  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.35/0.73  % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.35/0.73  % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 3961636 completed with status 0
% 0.35/0.73  % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.35/0.73  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.35/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.35/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.35/0.73  % No SInE strategy applied
% 0.35/0.73  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.35/0.73  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.73  % Starting SubtermCWHack with 136s (1) cores
% 0.35/0.73  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.35/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 0.35/0.73  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.35/0.73  % Preprocessing time       : 0.017 s
% 0.35/0.73  % Presaturation interreduction done
% 0.35/0.73  
% 0.35/0.73  % Proof found!
% 0.35/0.73  % SZS status Unsatisfiable
% 0.35/0.73  % SZS output start CNFRefutation
% See solution above
% 0.35/0.73  % Parsed axioms                        : 704
% 0.35/0.73  % Removed by relevancy pruning/SinE    : 0
% 0.35/0.73  % Initial clauses                      : 704
% 0.35/0.73  % Removed in clause preprocessing      : 4
% 0.35/0.73  % Initial clauses in saturation        : 700
% 0.35/0.73  % Processed clauses                    : 914
% 0.35/0.73  % ...of these trivial                  : 26
% 0.35/0.73  % ...subsumed                          : 132
% 0.35/0.73  % ...remaining for further processing  : 756
% 0.35/0.73  % Other redundant clauses eliminated   : 2
% 0.35/0.73  % Clauses deleted for lack of memory   : 0
% 0.35/0.73  % Backward-subsumed                    : 1
% 0.35/0.73  % Backward-rewritten                   : 3
% 0.35/0.73  % Generated clauses                    : 165
% 0.35/0.73  % ...of the previous two non-redundant : 89
% 0.35/0.73  % ...aggressively subsumed             : 0
% 0.35/0.73  % Contextual simplify-reflections      : 4
% 0.35/0.73  % Paramodulations                      : 159
% 0.35/0.73  % Factorizations                       : 2
% 0.35/0.73  % NegExts                              : 0
% 0.35/0.73  % Equation resolutions                 : 4
% 0.35/0.73  % Disequality decompositions           : 0
% 0.35/0.73  % Total rewrite steps                  : 355
% 0.35/0.73  % ...of those cached                   : 231
% 0.35/0.73  % Propositional unsat checks           : 0
% 0.35/0.73  %    Propositional check models        : 0
% 0.35/0.73  %    Propositional check unsatisfiable : 0
% 0.35/0.73  %    Propositional clauses             : 0
% 0.35/0.73  %    Propositional clauses after purity: 0
% 0.35/0.73  %    Propositional unsat core size     : 0
% 0.35/0.73  %    Propositional preprocessing time  : 0.000
% 0.35/0.73  %    Propositional encoding time       : 0.000
% 0.35/0.73  %    Propositional solver time         : 0.000
% 0.35/0.73  %    Success case prop preproc time    : 0.000
% 0.35/0.73  %    Success case prop encoding time   : 0.000
% 0.35/0.73  %    Success case prop solver time     : 0.000
% 0.35/0.73  % Current number of processed clauses  : 199
% 0.35/0.73  %    Positive orientable unit clauses  : 88
% 0.35/0.73  %    Positive unorientable unit clauses: 2
% 0.35/0.73  %    Negative unit clauses             : 32
% 0.35/0.73  %    Non-unit-clauses                  : 77
% 0.35/0.73  % Current number of unprocessed clauses: 426
% 0.35/0.73  % ...number of literals in the above   : 1015
% 0.35/0.73  % Current number of archived formulas  : 0
% 0.35/0.73  % Current number of archived clauses   : 558
% 0.35/0.73  % Clause-clause subsumption calls (NU) : 32620
% 0.35/0.73  % Rec. Clause-clause subsumption calls : 23751
% 0.35/0.73  % Non-unit clause-clause subsumptions  : 95
% 0.35/0.73  % Unit Clause-clause subsumption calls : 1096
% 0.35/0.73  % Rewrite failures with RHS unbound    : 0
% 0.35/0.73  % BW rewrite match attempts            : 335
% 0.35/0.73  % BW rewrite match successes           : 39
% 0.35/0.73  % Condensation attempts                : 0
% 0.35/0.73  % Condensation successes               : 0
% 0.35/0.73  % Termbank termtop insertions          : 34398
% 0.35/0.73  % Search garbage collected termcells   : 1353
% 0.35/0.73  
% 0.35/0.73  % -------------------------------------------------
% 0.35/0.73  % User time                : 0.149 s
% 0.35/0.73  % System time              : 0.015 s
% 0.35/0.73  % Total time               : 0.164 s
% 0.35/0.73  % Maximum resident set size: 4952 pages
% 0.35/0.73  
% 0.35/0.73  % -------------------------------------------------
% 0.35/0.73  % User time                : 0.664 s
% 0.35/0.73  % System time              : 0.053 s
% 0.35/0.73  % Total time               : 0.717 s
% 0.35/0.73  % Maximum resident set size: 5376 pages
% 0.35/0.73  % E exiting
%------------------------------------------------------------------------------