↑ 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  : LCL806-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 : n005.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 01:23:23 PM UTC 2026

% Result   : Unsatisfiable 0.60s 0.51s
% Output   : CNFRefutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (  10 unt;   0 nHn;  14 RR)
%            Number of literals    :   25 (   0 equ;  14 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :   12 (  12 usr;  10 con; 0-2 aty)
%            Number of variables   :   13 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Cons_I1_J_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X3),X2),v_T____)),v_b____),X4))
    | ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
    | ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X3),X1),v_T____))
    | hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),X1),X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Cons_I1_J_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),v_xb),v_xc))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_0,negated_conjecture,
    hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),v_x),v_xc),v_T____)),v_b____),v_xa)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,v_x),v_xb),v_T____)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_1,negated_conjecture,
    hBOOL(hAPP(c_InductTermi_OIT,v_xb)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_0_5,plain,
    ( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X3),X2),v_T____)),v_b____),X4))
    | ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
    | ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X3),X1),v_T____))
    | hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),X1),X2))) ),
    inference(fof_simplification,[status(thm)],[cls_Cons_I1_J_0]) ).

cnf(c_0_6,negated_conjecture,
    ~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),v_xb),v_xc))),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_7,plain,
    ( ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),X3),X2),v_T____)),v_b____),X4))
    | ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
    | ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,X3),X1),v_T____))
    | hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),X1),X2))) ),
    c_0_5 ).

cnf(c_0_8,negated_conjecture,
    hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,hAPP(hAPP(hAPP(c_Type_Oshift(tc_Type_Otype),v_x),v_xc),v_T____)),v_b____),v_xa)),
    cls_conjecture_0 ).

cnf(c_0_9,negated_conjecture,
    ~ hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),v_xb),v_xc))),
    c_0_6 ).

cnf(c_0_10,negated_conjecture,
    ( ~ hBOOL(hAPP(c_InductTermi_OIT,X1))
    | ~ hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,v_x),X1),v_T____))
    | hBOOL(hAPP(c_InductTermi_OIT,hAPP(hAPP(hAPP(c_Lambda_Osubst,v_b____),X1),v_xc))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    hBOOL(hAPP(hAPP(hAPP(c_Type_Otyping,v_x),v_xb),v_T____)),
    cls_conjecture_2 ).

cnf(c_0_12,negated_conjecture,
    hBOOL(hAPP(c_InductTermi_OIT,v_xb)),
    cls_conjecture_1 ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL806-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.10/0.36  % Computer : n005.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 01:05:18 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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.60/0.51  % Version: 3.5.1
% 0.60/0.51  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.60/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.60/0.51  % Starting new_bool_3 with 600s (2) cores
% 0.60/0.51  % Starting new_bool_1 with 300s (1) cores
% 0.60/0.51  % Starting sh5l with 300s (1) cores
% 0.60/0.51  % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 2209960 completed with status 0
% 0.60/0.51  % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 0.60/0.51  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.60/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.60/0.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.60/0.51  % No SInE strategy applied
% 0.60/0.51  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.60/0.51  % Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 0.60/0.51  % Starting SubtermCWHack with 109s (1) cores
% 0.60/0.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.60/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 90s (1) cores
% 0.60/0.51  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 90s (1) cores
% 0.60/0.51  % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 2209976 completed with status 0
% 0.60/0.51  % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.60/0.51  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.60/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.60/0.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.60/0.51  % No SInE strategy applied
% 0.60/0.51  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.60/0.51  % Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 0.60/0.51  % Starting SubtermCWHack with 109s (1) cores
% 0.60/0.51  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 0.60/0.51  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 90s (1) cores
% 0.60/0.51  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 90s (1) cores
% 0.60/0.51  % Preprocessing time       : 0.008 s
% 0.60/0.51  % Presaturation interreduction done
% 0.60/0.51  
% 0.60/0.51  % Proof found!
% 0.60/0.51  % SZS status Unsatisfiable
% 0.60/0.51  % SZS output start CNFRefutation
% See solution above
% 0.60/0.51  % Parsed axioms                        : 411
% 0.60/0.51  % Removed by relevancy pruning/SinE    : 0
% 0.60/0.51  % Initial clauses                      : 411
% 0.60/0.51  % Removed in clause preprocessing      : 2
% 0.60/0.51  % Initial clauses in saturation        : 409
% 0.60/0.51  % Processed clauses                    : 660
% 0.60/0.51  % ...of these trivial                  : 33
% 0.60/0.51  % ...subsumed                          : 125
% 0.60/0.51  % ...remaining for further processing  : 502
% 0.60/0.51  % Other redundant clauses eliminated   : 8
% 0.60/0.51  % Clauses deleted for lack of memory   : 0
% 0.60/0.51  % Backward-subsumed                    : 2
% 0.60/0.51  % Backward-rewritten                   : 4
% 0.60/0.51  % Generated clauses                    : 448
% 0.60/0.51  % ...of the previous two non-redundant : 290
% 0.60/0.51  % ...aggressively subsumed             : 0
% 0.60/0.51  % Contextual simplify-reflections      : 0
% 0.60/0.51  % Paramodulations                      : 436
% 0.60/0.51  % Factorizations                       : 2
% 0.60/0.51  % NegExts                              : 0
% 0.60/0.51  % Equation resolutions                 : 10
% 0.60/0.51  % Disequality decompositions           : 0
% 0.60/0.51  % Total rewrite steps                  : 300
% 0.60/0.51  % ...of those cached                   : 191
% 0.60/0.51  % Propositional unsat checks           : 0
% 0.60/0.51  %    Propositional check models        : 0
% 0.60/0.51  %    Propositional check unsatisfiable : 0
% 0.60/0.51  %    Propositional clauses             : 0
% 0.60/0.51  %    Propositional clauses after purity: 0
% 0.60/0.51  %    Propositional unsat core size     : 0
% 0.60/0.51  %    Propositional preprocessing time  : 0.000
% 0.60/0.51  %    Propositional encoding time       : 0.000
% 0.60/0.51  %    Propositional solver time         : 0.000
% 0.60/0.51  %    Success case prop preproc time    : 0.000
% 0.60/0.51  %    Success case prop encoding time   : 0.000
% 0.60/0.51  %    Success case prop solver time     : 0.000
% 0.60/0.51  % Current number of processed clauses  : 171
% 0.60/0.51  %    Positive orientable unit clauses  : 85
% 0.60/0.51  %    Positive unorientable unit clauses: 1
% 0.60/0.51  %    Negative unit clauses             : 17
% 0.60/0.51  %    Non-unit-clauses                  : 68
% 0.60/0.51  % Current number of unprocessed clauses: 363
% 0.60/0.51  % ...number of literals in the above   : 734
% 0.60/0.51  % Current number of archived formulas  : 0
% 0.60/0.51  % Current number of archived clauses   : 332
% 0.60/0.51  % Clause-clause subsumption calls (NU) : 6217
% 0.60/0.51  % Rec. Clause-clause subsumption calls : 4881
% 0.60/0.51  % Non-unit clause-clause subsumptions  : 59
% 0.60/0.51  % Unit Clause-clause subsumption calls : 313
% 0.60/0.51  % Rewrite failures with RHS unbound    : 0
% 0.60/0.51  % BW rewrite match attempts            : 243
% 0.60/0.51  % BW rewrite match successes           : 23
% 0.60/0.51  % Condensation attempts                : 0
% 0.60/0.51  % Condensation successes               : 0
% 0.60/0.51  % Termbank termtop insertions          : 26732
% 0.60/0.51  % Search garbage collected termcells   : 678
% 0.60/0.51  
% 0.60/0.51  % -------------------------------------------------
% 0.60/0.51  % User time                : 0.058 s
% 0.60/0.51  % System time              : 0.012 s
% 0.60/0.51  % Total time               : 0.069 s
% 0.60/0.51  % Maximum resident set size: 4536 pages
% 0.60/0.51  
% 0.60/0.51  % -------------------------------------------------
% 0.60/0.51  % User time                : 0.232 s
% 0.60/0.51  % System time              : 0.036 s
% 0.60/0.51  % Total time               : 0.267 s
% 0.60/0.51  % Maximum resident set size: 4864 pages
% 0.60/0.51  % E exiting
%------------------------------------------------------------------------------