TSTP Solution File: CSR108+7 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CSR108+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 19:18:42 EDT 2024

% Result   : Theorem 3.80s 2.86s
% Output   : CNFRefutation 3.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   4 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   21 (   9   ~;   6   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    7 (   1 sgn   3   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
    ? [X2351] :
      ( s__instance(s__Entity44_1,X2351)
      & s__instance(s__Entity44_2,X2351)
      & s__instance(s__Entity44_9,X2351)
      & s__instance(s__Entity44_10,X2351) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).

fof(kb_SUMO_27371,axiom,
    ! [X857] : s__instance(X857,s__Entity),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27371) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X2351] :
        ( s__instance(s__Entity44_1,X2351)
        & s__instance(s__Entity44_2,X2351)
        & s__instance(s__Entity44_9,X2351)
        & s__instance(s__Entity44_10,X2351) ),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

fof(c_0_3,negated_conjecture,
    ! [X2352] :
      ( ~ s__instance(s__Entity44_1,X2352)
      | ~ s__instance(s__Entity44_2,X2352)
      | ~ s__instance(s__Entity44_9,X2352)
      | ~ s__instance(s__Entity44_10,X2352) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X2353] : s__instance(X2353,s__Entity),
    inference(variable_rename,[status(thm)],[kb_SUMO_27371]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ s__instance(s__Entity44_1,X1)
    | ~ s__instance(s__Entity44_2,X1)
    | ~ s__instance(s__Entity44_9,X1)
    | ~ s__instance(s__Entity44_10,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    s__instance(X1,s__Entity),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_6]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : CSR108+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n021.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Sun May 19 01:51:53 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/2.86  # Version: 3.1.0
% 3.80/2.86  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.80/2.86  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 3.80/2.86  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 3.80/2.86  # Starting new_bool_3 with 298s (1) cores
% 3.80/2.86  # Starting new_bool_1 with 298s (1) cores
% 3.80/2.86  # Starting sh5l with 298s (1) cores
% 3.80/2.86  # new_bool_3 with pid 24507 completed with status 0
% 3.80/2.86  # Result found by new_bool_3
% 3.80/2.86  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.80/2.86  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 3.80/2.86  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 3.80/2.86  # Starting new_bool_3 with 298s (1) cores
% 3.80/2.86  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.80/2.86  # Search class: FHHSF-FFMM00-SFFFFFNN
% 3.80/2.86  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 3.80/2.86  # Starting SAT001_MinMin_p005000_rr_RG with 179s (1) cores
% 3.80/2.86  # SAT001_MinMin_p005000_rr_RG with pid 24510 completed with status 0
% 3.80/2.86  # Result found by SAT001_MinMin_p005000_rr_RG
% 3.80/2.86  # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.80/2.86  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 3.80/2.86  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 3.80/2.86  # Starting new_bool_3 with 298s (1) cores
% 3.80/2.86  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.80/2.86  # Search class: FHHSF-FFMM00-SFFFFFNN
% 3.80/2.86  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 3.80/2.86  # Starting SAT001_MinMin_p005000_rr_RG with 179s (1) cores
% 3.80/2.86  # Preprocessing time       : 0.021 s
% 3.80/2.86  # Presaturation interreduction done
% 3.80/2.86  
% 3.80/2.86  # Proof found!
% 3.80/2.86  # SZS status Theorem
% 3.80/2.86  # SZS output start CNFRefutation
% See solution above
% 3.80/2.86  # Parsed axioms                        : 55611
% 3.80/2.86  # Removed by relevancy pruning/SinE    : 55562
% 3.80/2.86  # Initial clauses                      : 56
% 3.80/2.86  # Removed in clause preprocessing      : 4
% 3.80/2.86  # Initial clauses in saturation        : 52
% 3.80/2.86  # Processed clauses                    : 59
% 3.80/2.86  # ...of these trivial                  : 5
% 3.80/2.86  # ...subsumed                          : 0
% 3.80/2.86  # ...remaining for further processing  : 54
% 3.80/2.86  # Other redundant clauses eliminated   : 0
% 3.80/2.86  # Clauses deleted for lack of memory   : 0
% 3.80/2.86  # Backward-subsumed                    : 0
% 3.80/2.86  # Backward-rewritten                   : 6
% 3.80/2.86  # Generated clauses                    : 3
% 3.80/2.86  # ...of the previous two non-redundant : 2
% 3.80/2.86  # ...aggressively subsumed             : 0
% 3.80/2.86  # Contextual simplify-reflections      : 9
% 3.80/2.86  # Paramodulations                      : 3
% 3.80/2.86  # Factorizations                       : 0
% 3.80/2.86  # NegExts                              : 0
% 3.80/2.86  # Equation resolutions                 : 0
% 3.80/2.86  # Disequality decompositions           : 0
% 3.80/2.86  # Total rewrite steps                  : 14
% 3.80/2.86  # ...of those cached                   : 3
% 3.80/2.86  # Propositional unsat checks           : 0
% 3.80/2.86  #    Propositional check models        : 0
% 3.80/2.86  #    Propositional check unsatisfiable : 0
% 3.80/2.86  #    Propositional clauses             : 0
% 3.80/2.86  #    Propositional clauses after purity: 0
% 3.80/2.86  #    Propositional unsat core size     : 0
% 3.80/2.86  #    Propositional preprocessing time  : 0.000
% 3.80/2.86  #    Propositional encoding time       : 0.000
% 3.80/2.86  #    Propositional solver time         : 0.000
% 3.80/2.86  #    Success case prop preproc time    : 0.000
% 3.80/2.86  #    Success case prop encoding time   : 0.000
% 3.80/2.86  #    Success case prop solver time     : 0.000
% 3.80/2.86  # Current number of processed clauses  : 7
% 3.80/2.86  #    Positive orientable unit clauses  : 4
% 3.80/2.86  #    Positive unorientable unit clauses: 0
% 3.80/2.86  #    Negative unit clauses             : 0
% 3.80/2.86  #    Non-unit-clauses                  : 3
% 3.80/2.86  # Current number of unprocessed clauses: 36
% 3.80/2.86  # ...number of literals in the above   : 52
% 3.80/2.86  # Current number of archived formulas  : 0
% 3.80/2.86  # Current number of archived clauses   : 47
% 3.80/2.86  # Clause-clause subsumption calls (NU) : 47
% 3.80/2.86  # Rec. Clause-clause subsumption calls : 26
% 3.80/2.86  # Non-unit clause-clause subsumptions  : 9
% 3.80/2.86  # Unit Clause-clause subsumption calls : 0
% 3.80/2.86  # Rewrite failures with RHS unbound    : 0
% 3.80/2.86  # BW rewrite match attempts            : 6
% 3.80/2.86  # BW rewrite match successes           : 6
% 3.80/2.86  # Condensation attempts                : 0
% 3.80/2.86  # Condensation successes               : 0
% 3.80/2.86  # Termbank termtop insertions          : 650276
% 3.80/2.86  # Search garbage collected termcells   : 291079
% 3.80/2.86  
% 3.80/2.86  # -------------------------------------------------
% 3.80/2.86  # User time                : 0.239 s
% 3.80/2.86  # System time              : 0.113 s
% 3.80/2.86  # Total time               : 0.352 s
% 3.80/2.86  # Maximum resident set size: 131740 pages
% 3.80/2.86  
% 3.80/2.86  # -------------------------------------------------
% 3.80/2.86  # User time                : 2.194 s
% 3.80/2.86  # System time              : 0.188 s
% 3.80/2.86  # Total time               : 2.381 s
% 3.80/2.86  # Maximum resident set size: 57400 pages
% 3.80/2.86  % E---3.1 exiting
%------------------------------------------------------------------------------