↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL025-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n013.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:11:34 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.48s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   19 (  10 unt;   0 nHn;  12 RR)
%            Number of literals    :   33 (   0 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   39 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(X1)
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(c0_6,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_6) ).

cnf(c0_2,axiom,
    is_a_theorem(implies(X1,implies(X2,X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_2) ).

cnf(prove_c0_1,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_1) ).

cnf(c_0_4,plain,
    ( ~ is_a_theorem(X1)
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(X2) ),
    inference(fof_simplification,[status(thm)],[condensed_detachment]) ).

cnf(c_0_5,plain,
    ( ~ is_a_theorem(X1)
    | ~ is_a_theorem(implies(X1,X2))
    | is_a_theorem(X2) ),
    c_0_4 ).

cnf(c_0_6,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    c0_6 ).

cnf(c_0_7,plain,
    ( ~ is_a_theorem(implies(X1,implies(X2,X3)))
    | is_a_theorem(implies(implies(X1,X2),implies(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,axiom,
    is_a_theorem(implies(X1,implies(X2,X1))),
    c0_2 ).

cnf(c_0_9,plain,
    ( ~ is_a_theorem(implies(X1,X3))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_10,plain,
    ( ~ is_a_theorem(X2)
    | is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

cnf(c_0_11,plain,
    ( ~ is_a_theorem(implies(X3,X2))
    | ~ is_a_theorem(implies(X1,X3))
    | is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,plain,
    ( ~ is_a_theorem(implies(implies(X3,X1),X2))
    | is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    inference(fof_simplification,[status(thm)],[prove_c0_1]) ).

cnf(c_0_14,plain,
    ( ~ is_a_theorem(implies(X2,implies(X1,X3)))
    | is_a_theorem(implies(X1,implies(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_12,c_0_7]) ).

cnf(c_0_15,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
    inference(spm,[status(thm)],[c_0_12,c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    c_0_13 ).

cnf(c_0_17,plain,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL025-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n013.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 00:00:06 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43  Running first-order theorem proving
% 0.15/0.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/0.48  % Version: 3.5.1
% 0.15/0.48  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48  % Starting sh5l with 300s (1) cores
% 0.15/0.48  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3731950 completed with status 0
% 0.15/0.48  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.48  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48  % No SInE strategy applied
% 0.15/0.48  % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.15/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.48  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.15/0.48  % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.48  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.48  % G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with pid 3731958 completed with status 0
% 0.15/0.48  % Result found by G-E--_060_C18_F1_PI_AE_CS_SP_S0Y
% 0.15/0.48  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48  % No SInE strategy applied
% 0.15/0.48  % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.15/0.48  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.48  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.15/0.48  % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.48  % Preprocessing time       : 0.002 s
% 0.15/0.48  
% 0.15/0.48  % Proof found!
% 0.15/0.48  % SZS status Unsatisfiable
% 0.15/0.48  % SZS output start CNFRefutation
% See solution above
% 0.15/0.48  % Parsed axioms                        : 5
% 0.15/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.48  % Initial clauses                      : 5
% 0.15/0.48  % Removed in clause preprocessing      : 0
% 0.15/0.48  % Initial clauses in saturation        : 5
% 0.15/0.48  % Processed clauses                    : 136
% 0.15/0.48  % ...of these trivial                  : 1
% 0.15/0.48  % ...subsumed                          : 69
% 0.15/0.48  % ...remaining for further processing  : 66
% 0.15/0.48  % Other redundant clauses eliminated   : 0
% 0.15/0.48  % Clauses deleted for lack of memory   : 0
% 0.15/0.48  % Backward-subsumed                    : 0
% 0.15/0.48  % Backward-rewritten                   : 3
% 0.15/0.48  % Generated clauses                    : 486
% 0.15/0.48  % ...of the previous two non-redundant : 264
% 0.15/0.48  % ...aggressively subsumed             : 0
% 0.15/0.48  % Contextual simplify-reflections      : 0
% 0.15/0.48  % Paramodulations                      : 486
% 0.15/0.48  % Factorizations                       : 0
% 0.15/0.48  % NegExts                              : 0
% 0.15/0.48  % Equation resolutions                 : 0
% 0.15/0.48  % Disequality decompositions           : 0
% 0.15/0.48  % Total rewrite steps                  : 203
% 0.15/0.48  % ...of those cached                   : 160
% 0.15/0.48  % Propositional unsat checks           : 0
% 0.15/0.48  %    Propositional check models        : 0
% 0.15/0.48  %    Propositional check unsatisfiable : 0
% 0.15/0.48  %    Propositional clauses             : 0
% 0.15/0.48  %    Propositional clauses after purity: 0
% 0.15/0.48  %    Propositional unsat core size     : 0
% 0.15/0.48  %    Propositional preprocessing time  : 0.000
% 0.15/0.48  %    Propositional encoding time       : 0.000
% 0.15/0.48  %    Propositional solver time         : 0.000
% 0.15/0.48  %    Success case prop preproc time    : 0.000
% 0.15/0.48  %    Success case prop encoding time   : 0.000
% 0.15/0.48  %    Success case prop solver time     : 0.000
% 0.15/0.48  % Current number of processed clauses  : 63
% 0.15/0.48  %    Positive orientable unit clauses  : 32
% 0.15/0.48  %    Positive unorientable unit clauses: 0
% 0.15/0.48  %    Negative unit clauses             : 5
% 0.15/0.48  %    Non-unit-clauses                  : 26
% 0.15/0.48  % Current number of unprocessed clauses: 130
% 0.15/0.48  % ...number of literals in the above   : 236
% 0.15/0.48  % Current number of archived formulas  : 0
% 0.15/0.48  % Current number of archived clauses   : 3
% 0.15/0.48  % Clause-clause subsumption calls (NU) : 397
% 0.15/0.48  % Rec. Clause-clause subsumption calls : 392
% 0.15/0.48  % Non-unit clause-clause subsumptions  : 64
% 0.15/0.48  % Unit Clause-clause subsumption calls : 34
% 0.15/0.48  % Rewrite failures with RHS unbound    : 0
% 0.15/0.48  % BW rewrite match attempts            : 418
% 0.15/0.48  % BW rewrite match successes           : 3
% 0.15/0.48  % Condensation attempts                : 0
% 0.15/0.48  % Condensation successes               : 0
% 0.15/0.48  % Termbank termtop insertions          : 4642
% 0.15/0.48  % Search garbage collected termcells   : 8
% 0.15/0.48  
% 0.15/0.48  % -------------------------------------------------
% 0.15/0.48  % User time                : 0.012 s
% 0.15/0.48  % System time              : 0.008 s
% 0.15/0.48  % Total time               : 0.019 s
% 0.15/0.48  % Maximum resident set size: 3632 pages
% 0.15/0.48  
% 0.15/0.48  % -------------------------------------------------
% 0.15/0.48  % User time                : 0.045 s
% 0.15/0.48  % System time              : 0.026 s
% 0.15/0.48  % Total time               : 0.071 s
% 0.15/0.48  % Maximum resident set size: 4608 pages
% 0.15/0.48  % E exiting
%------------------------------------------------------------------------------