TSTP Solution File: SWV414+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SWV414+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n032.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 : Tue May 21 05:23:14 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] : i(triple(create_pqp,create_slb,X1)) = create_pq,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(ax54,axiom,
    ! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1] : i(triple(create_pqp,create_slb,X1)) = create_pq,
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_3,negated_conjecture,
    i(triple(create_pqp,create_slb,esk1_0)) != create_pq,
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
    ! [X8,X9] : i(triple(X8,create_slb,X9)) = create_pq,
    inference(variable_rename,[status(thm)],[ax54]) ).

cnf(c_0_5,negated_conjecture,
    i(triple(create_pqp,create_slb,esk1_0)) != create_pq,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    i(triple(X1,create_slb,X2)) = create_pq,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.08  % Problem    : SWV414+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.09  % Command    : run_E %s %d THM
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit   : 300
% 0.08/0.28  % WCLimit    : 300
% 0.08/0.28  % DateTime   : Sun May 19 09:18:38 EDT 2024
% 0.08/0.28  % CPUTime    : 
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.13/0.42  # Version: 3.1.0
% 0.13/0.42  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42  # Starting sh5l with 300s (1) cores
% 0.13/0.42  # new_bool_3 with pid 24647 completed with status 0
% 0.13/0.42  # Result found by new_bool_3
% 0.13/0.42  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42  # Search class: FGUSS-FFSF32-MFFFFFNN
% 0.13/0.42  # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.13/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42  # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.13/0.42  # SAT001_MinMin_p005000_rr_RG with pid 24650 completed with status 0
% 0.13/0.42  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.42  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42  # Search class: FGUSS-FFSF32-MFFFFFNN
% 0.13/0.42  # partial match(1): FGUSS-FFSF22-MFFFFFNN
% 0.13/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42  # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.13/0.42  # Preprocessing time       : 0.003 s
% 0.13/0.42  # Presaturation interreduction done
% 0.13/0.42  
% 0.13/0.42  # Proof found!
% 0.13/0.42  # SZS status Theorem
% 0.13/0.42  # SZS output start CNFRefutation
% See solution above
% 0.13/0.42  # Parsed axioms                        : 63
% 0.13/0.42  # Removed by relevancy pruning/SinE    : 55
% 0.13/0.42  # Initial clauses                      : 12
% 0.13/0.42  # Removed in clause preprocessing      : 0
% 0.13/0.42  # Initial clauses in saturation        : 12
% 0.13/0.42  # Processed clauses                    : 4
% 0.13/0.42  # ...of these trivial                  : 0
% 0.13/0.42  # ...subsumed                          : 0
% 0.13/0.42  # ...remaining for further processing  : 4
% 0.13/0.42  # Other redundant clauses eliminated   : 0
% 0.13/0.42  # Clauses deleted for lack of memory   : 0
% 0.13/0.42  # Backward-subsumed                    : 0
% 0.13/0.42  # Backward-rewritten                   : 1
% 0.13/0.42  # Generated clauses                    : 0
% 0.13/0.42  # ...of the previous two non-redundant : 0
% 0.13/0.42  # ...aggressively subsumed             : 0
% 0.13/0.42  # Contextual simplify-reflections      : 0
% 0.13/0.42  # Paramodulations                      : 0
% 0.13/0.42  # Factorizations                       : 0
% 0.13/0.42  # NegExts                              : 0
% 0.13/0.42  # Equation resolutions                 : 0
% 0.13/0.42  # Disequality decompositions           : 0
% 0.13/0.42  # Total rewrite steps                  : 1
% 0.13/0.42  # ...of those cached                   : 0
% 0.13/0.42  # Propositional unsat checks           : 0
% 0.13/0.42  #    Propositional check models        : 0
% 0.13/0.42  #    Propositional check unsatisfiable : 0
% 0.13/0.42  #    Propositional clauses             : 0
% 0.13/0.42  #    Propositional clauses after purity: 0
% 0.13/0.42  #    Propositional unsat core size     : 0
% 0.13/0.42  #    Propositional preprocessing time  : 0.000
% 0.13/0.42  #    Propositional encoding time       : 0.000
% 0.13/0.42  #    Propositional solver time         : 0.000
% 0.13/0.42  #    Success case prop preproc time    : 0.000
% 0.13/0.42  #    Success case prop encoding time   : 0.000
% 0.13/0.42  #    Success case prop solver time     : 0.000
% 0.13/0.42  # Current number of processed clauses  : 3
% 0.13/0.42  #    Positive orientable unit clauses  : 1
% 0.13/0.42  #    Positive unorientable unit clauses: 0
% 0.13/0.42  #    Negative unit clauses             : 2
% 0.13/0.42  #    Non-unit-clauses                  : 0
% 0.13/0.42  # Current number of unprocessed clauses: 8
% 0.13/0.42  # ...number of literals in the above   : 16
% 0.13/0.42  # Current number of archived formulas  : 0
% 0.13/0.42  # Current number of archived clauses   : 1
% 0.13/0.42  # Clause-clause subsumption calls (NU) : 0
% 0.13/0.42  # Rec. Clause-clause subsumption calls : 0
% 0.13/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.13/0.42  # Unit Clause-clause subsumption calls : 0
% 0.13/0.42  # Rewrite failures with RHS unbound    : 0
% 0.13/0.42  # BW rewrite match attempts            : 1
% 0.13/0.42  # BW rewrite match successes           : 1
% 0.13/0.42  # Condensation attempts                : 0
% 0.13/0.42  # Condensation successes               : 0
% 0.13/0.42  # Termbank termtop insertions          : 1107
% 0.13/0.42  # Search garbage collected termcells   : 478
% 0.13/0.42  
% 0.13/0.42  # -------------------------------------------------
% 0.13/0.42  # User time                : 0.004 s
% 0.13/0.42  # System time              : 0.002 s
% 0.13/0.42  # Total time               : 0.007 s
% 0.13/0.42  # Maximum resident set size: 1900 pages
% 0.13/0.42  
% 0.13/0.42  # -------------------------------------------------
% 0.13/0.42  # User time                : 0.007 s
% 0.13/0.42  # System time              : 0.004 s
% 0.13/0.42  # Total time               : 0.011 s
% 0.13/0.42  # Maximum resident set size: 1772 pages
% 0.13/0.42  % E---3.1 exiting
% 0.13/0.42  % E exiting
%------------------------------------------------------------------------------