TSTP Solution File: CSR032+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.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 : Sat May  4 07:35:11 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(query32,conjecture,
    ? [X17] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
     => isa(f_citynamedfn(s_agen,c_france),X17) ),
    file('/export/starexec/sandbox/tmp/tmp.4DwPZoqgQP/E---3.1_9422.p',query32) ).

fof(just57,axiom,
    ! [X10] :
      ( individual(X10)
     => isa(X10,c_individual) ),
    file('/export/starexec/sandbox/tmp/tmp.4DwPZoqgQP/E---3.1_9422.p',just57) ).

fof(just1,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('/export/starexec/sandbox/tmp/tmp.4DwPZoqgQP/E---3.1_9422.p',just1) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X17] :
        ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
       => isa(f_citynamedfn(s_agen,c_france),X17) ),
    inference(assume_negation,[status(cth)],[query32]) ).

fof(c_0_4,plain,
    ! [X45] :
      ( ~ individual(X45)
      | isa(X45,c_individual) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just57])])]) ).

fof(c_0_5,negated_conjecture,
    ! [X18] :
      ( mtvisible(c_reasoningaboutpossibleantecedentsmt)
      & ~ isa(f_citynamedfn(s_agen,c_france),X18) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_6,plain,
    ( isa(X1,c_individual)
    | ~ individual(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    individual(f_citynamedfn(s_agen,c_france)),
    inference(split_conjunct,[status(thm)],[just1]) ).

cnf(c_0_8,negated_conjecture,
    ~ isa(f_citynamedfn(s_agen,c_france),X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : CSR032+1 : TPTP v8.1.2. Released v3.4.0.
% 0.13/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 14:55:38 EDT 2024
% 0.20/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.4DwPZoqgQP/E---3.1_9422.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 9500 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # SAT001_MinMin_p005000_rr_RG with pid 9503 completed with status 0
% 0.20/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FHUNF-FFSM22-SFFFFFNN
% 0.20/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 68
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 40
% 0.20/0.50  # Initial clauses                      : 29
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 29
% 0.20/0.50  # Processed clauses                    : 38
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 6
% 0.20/0.50  # ...remaining for further processing  : 32
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 0
% 0.20/0.50  # Backward-rewritten                   : 0
% 0.20/0.50  # Generated clauses                    : 2
% 0.20/0.50  # ...of the previous two non-redundant : 1
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 2
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 0
% 0.20/0.50  # ...of those cached                   : 0
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 9
% 0.20/0.50  #    Positive orientable unit clauses  : 5
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 1
% 0.20/0.50  #    Non-unit-clauses                  : 3
% 0.20/0.50  # Current number of unprocessed clauses: 15
% 0.20/0.50  # ...number of literals in the above   : 31
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 23
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 21
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 21
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 6
% 0.20/0.50  # Unit Clause-clause subsumption calls : 0
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 0
% 0.20/0.50  # BW rewrite match successes           : 0
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 1809
% 0.20/0.50  # Search garbage collected termcells   : 458
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.003 s
% 0.20/0.50  # Total time               : 0.006 s
% 0.20/0.50  # Maximum resident set size: 1888 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.004 s
% 0.20/0.50  # System time              : 0.006 s
% 0.20/0.50  # Total time               : 0.010 s
% 0.20/0.50  # Maximum resident set size: 1768 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------