↑ Up

E---3.5.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL657+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n010.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:15:17 PM UTC 2026

% Result   : CounterSatisfiable 0.12s 0.45s
% Output   : Saturation 0.12s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_4ERROR: Could not build tree for root c_0_10ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_5,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p100(X2)
    | ~ p1(X2)
    | ~ r1(X1,X2)
    | p1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_6,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | p101(X1)
    | r1(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_7,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | p101(X1)
    | r1(X1,esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_8,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p1(X1)
    | ~ p100(X2)
    | ~ r1(X1,X2)
    | p1(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_10,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p100(esk2_1(X1))
    | ~ p1(esk2_1(X1))
    | p101(X1)
    | p1(X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]),
    [final] ).

cnf(c_0_11,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p100(esk3_1(X1))
    | ~ p1(esk3_1(X1))
    | p101(X1)
    | p1(X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]),
    [final] ).

cnf(c_0_12,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p100(esk2_1(X1))
    | ~ p1(X1)
    | p101(X1)
    | p1(esk2_1(X1)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_6]),
    [final] ).

cnf(c_0_13,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p100(esk3_1(X1))
    | ~ p1(X1)
    | p101(X1)
    | p1(esk3_1(X1)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]),
    [final] ).

cnf(c_0_14,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p101(X1)
    | ~ p101(X2)
    | ~ p2(X2)
    | ~ r1(X1,X2)
    | p2(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_15,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p101(X1)
    | ~ p2(X1)
    | ~ p101(X2)
    | ~ r1(X1,X2)
    | p2(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_16,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p102(esk3_1(X1))
    | p101(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_17,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p102(esk2_1(X1))
    | p101(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_18,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | p101(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_19,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | p101(X1)
    | p101(esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_20,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | p101(X1)
    | p101(esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_21,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p100(X1)
    | p101(X1)
    | p2(esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_22,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p101(X1)
    | p100(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_23,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p102(X1)
    | p101(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_24,negated_conjecture,
    ~ p101(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

cnf(c_0_25,plain,
    r1(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_9]),
    [final] ).

cnf(c_0_26,negated_conjecture,
    p100(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL657+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n010.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep 21 00:48:25 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  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.12/0.44  % Version: 3.5.1
% 0.12/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44  % Starting sh5l with 300s (1) cores
% 0.12/0.44  % new_bool_3 with pid 3897844 completed with status 1
% 0.12/0.44  % Result found by new_bool_3
% 0.12/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44  % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.12/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44  % SubtermCWHack with pid 3897849 completed with status 1
% 0.12/0.44  % Result found by SubtermCWHack
% 0.12/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45  % Search class: FGUNF-FFSF11-SFFFFFNN
% 0.12/0.45  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45  % Preprocessing time       : 0.002 s
% 0.12/0.45  
% 0.12/0.45  % No proof found!
% 0.12/0.45  % SZS status CounterSatisfiable
% 0.12/0.45  % SZS output start Saturation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 2
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.45  % Initial clauses                      : 17
% 0.12/0.45  % Removed in clause preprocessing      : 0
% 0.12/0.45  % Initial clauses in saturation        : 17
% 0.12/0.45  % Processed clauses                    : 21
% 0.12/0.45  % ...of these trivial                  : 0
% 0.12/0.45  % ...subsumed                          : 0
% 0.12/0.45  % ...remaining for further processing  : 21
% 0.12/0.45  % Other redundant clauses eliminated   : 0
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 0
% 0.12/0.45  % Backward-rewritten                   : 0
% 0.12/0.45  % Generated clauses                    : 14
% 0.12/0.45  % ...of the previous two non-redundant : 4
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 0
% 0.12/0.45  % Paramodulations                      : 14
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 0
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 0
% 0.12/0.45  % ...of those cached                   : 0
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 21
% 0.12/0.45  %    Positive orientable unit clauses  : 2
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 1
% 0.12/0.45  %    Non-unit-clauses                  : 18
% 0.12/0.45  % Current number of unprocessed clauses: 0
% 0.12/0.45  % ...number of literals in the above   : 0
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 0
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 16
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 8
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 0
% 0.12/0.45  % Unit Clause-clause subsumption calls : 0
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 0
% 0.12/0.45  % BW rewrite match successes           : 0
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 1820
% 0.12/0.45  % Search garbage collected termcells   : 233
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.005 s
% 0.12/0.45  % System time              : 0.004 s
% 0.12/0.45  % Total time               : 0.009 s
% 0.12/0.45  % Maximum resident set size: 3636 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.007 s
% 0.12/0.45  % System time              : 0.007 s
% 0.12/0.45  % Total time               : 0.014 s
% 0.12/0.45  % Maximum resident set size: 4864 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------