↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL076-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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:11:42 PM UTC 2026

% Result   : Unsatisfiable 0.23s 0.57s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (   9 unt;   0 nHn;   8 RR)
%            Number of literals    :   20 (   0 equ;  10 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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

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

cnf(cn_49,axiom,
    is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).

cnf(prove_cn_40,negated_conjecture,
    ~ is_a_theorem(implies(a,not(not(a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40) ).

cnf(extra_lemma,axiom,
    is_a_theorem(implies(not(not(X1)),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',extra_lemma) ).

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(not(X1),not(X2)),implies(X2,X1))),
    cn_49 ).

cnf(c_0_7,negated_conjecture,
    ~ is_a_theorem(implies(a,not(not(a)))),
    inference(fof_simplification,[status(thm)],[prove_cn_40]) ).

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

cnf(c_0_9,axiom,
    is_a_theorem(implies(not(not(X1)),X1)),
    extra_lemma ).

cnf(c_0_10,negated_conjecture,
    ~ is_a_theorem(implies(a,not(not(a)))),
    c_0_7 ).

cnf(c_0_11,plain,
    is_a_theorem(implies(X1,not(not(X1)))),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL076-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46  % Computer : n005.cluster.edu
% 0.20/0.46  % Model    : x86_64 x86_64
% 0.20/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46  % Memory   : 8046.5625MB
% 0.20/0.46  % OS       : Linux 6.8.0-71-generic
% 0.20/0.46  % CPULimit : 300
% 0.20/0.46  % WCLimit  : 300
% 0.20/0.46  % DateTime : Mon Sep 21 00:03:48 UTC 2026
% 0.20/0.47  % CPUTime  : 
% 0.20/0.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54  Running first-order theorem proving
% 0.23/0.54  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.23/0.57  % Version: 3.5.1
% 0.23/0.57  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57  % Starting sh5l with 300s (1) cores
% 0.23/0.57  % new_bool_3 with pid 2110916 completed with status 0
% 0.23/0.57  % Result found by new_bool_3
% 0.23/0.57  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57  % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.23/0.57  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57  % SubtermCWHack with pid 2110924 completed with status 0
% 0.23/0.57  % Result found by SubtermCWHack
% 0.23/0.57  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57  % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.23/0.57  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.57  % Preprocessing time       : 0.002 s
% 0.23/0.57  
% 0.23/0.57  % Proof found!
% 0.23/0.57  % SZS status Unsatisfiable
% 0.23/0.57  % SZS output start CNFRefutation
% See solution above
% 0.23/0.57  % Parsed axioms                        : 6
% 0.23/0.57  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.57  % Initial clauses                      : 6
% 0.23/0.57  % Removed in clause preprocessing      : 0
% 0.23/0.57  % Initial clauses in saturation        : 6
% 0.23/0.57  % Processed clauses                    : 10
% 0.23/0.57  % ...of these trivial                  : 0
% 0.23/0.57  % ...subsumed                          : 0
% 0.23/0.57  % ...remaining for further processing  : 10
% 0.23/0.57  % Other redundant clauses eliminated   : 0
% 0.23/0.57  % Clauses deleted for lack of memory   : 0
% 0.23/0.57  % Backward-subsumed                    : 0
% 0.23/0.57  % Backward-rewritten                   : 1
% 0.23/0.57  % Generated clauses                    : 9
% 0.23/0.57  % ...of the previous two non-redundant : 6
% 0.23/0.57  % ...aggressively subsumed             : 0
% 0.23/0.57  % Contextual simplify-reflections      : 0
% 0.23/0.57  % Paramodulations                      : 9
% 0.23/0.58  % Factorizations                       : 0
% 0.23/0.58  % NegExts                              : 0
% 0.23/0.58  % Equation resolutions                 : 0
% 0.23/0.58  % Disequality decompositions           : 0
% 0.23/0.58  % Total rewrite steps                  : 1
% 0.23/0.58  % ...of those cached                   : 0
% 0.23/0.58  % Propositional unsat checks           : 0
% 0.23/0.58  %    Propositional check models        : 0
% 0.23/0.58  %    Propositional check unsatisfiable : 0
% 0.23/0.58  %    Propositional clauses             : 0
% 0.23/0.58  %    Propositional clauses after purity: 0
% 0.23/0.58  %    Propositional unsat core size     : 0
% 0.23/0.58  %    Propositional preprocessing time  : 0.000
% 0.23/0.58  %    Propositional encoding time       : 0.000
% 0.23/0.58  %    Propositional solver time         : 0.000
% 0.23/0.58  %    Success case prop preproc time    : 0.000
% 0.23/0.58  %    Success case prop encoding time   : 0.000
% 0.23/0.58  %    Success case prop solver time     : 0.000
% 0.23/0.58  % Current number of processed clauses  : 9
% 0.23/0.58  %    Positive orientable unit clauses  : 4
% 0.23/0.58  %    Positive unorientable unit clauses: 0
% 0.23/0.58  %    Negative unit clauses             : 1
% 0.23/0.58  %    Non-unit-clauses                  : 4
% 0.23/0.58  % Current number of unprocessed clauses: 2
% 0.23/0.58  % ...number of literals in the above   : 3
% 0.23/0.58  % Current number of archived formulas  : 0
% 0.23/0.58  % Current number of archived clauses   : 1
% 0.23/0.58  % Clause-clause subsumption calls (NU) : 2
% 0.23/0.58  % Rec. Clause-clause subsumption calls : 2
% 0.23/0.58  % Non-unit clause-clause subsumptions  : 0
% 0.23/0.58  % Unit Clause-clause subsumption calls : 1
% 0.23/0.58  % Rewrite failures with RHS unbound    : 0
% 0.23/0.58  % BW rewrite match attempts            : 2
% 0.23/0.58  % BW rewrite match successes           : 1
% 0.23/0.58  % Condensation attempts                : 0
% 0.23/0.58  % Condensation successes               : 0
% 0.23/0.58  % Termbank termtop insertions          : 250
% 0.23/0.58  % Search garbage collected termcells   : 8
% 0.23/0.58  
% 0.23/0.58  % -------------------------------------------------
% 0.23/0.58  % User time                : 0.004 s
% 0.23/0.58  % System time              : 0.002 s
% 0.23/0.58  % Total time               : 0.005 s
% 0.23/0.58  % Maximum resident set size: 3632 pages
% 0.23/0.58  
% 0.23/0.58  % -------------------------------------------------
% 0.23/0.58  % User time                : 0.005 s
% 0.23/0.58  % System time              : 0.006 s
% 0.23/0.58  % Total time               : 0.011 s
% 0.23/0.58  % Maximum resident set size: 4864 pages
% 0.23/0.58  % E exiting
%------------------------------------------------------------------------------