TSTP Solution File: CSR055-10 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : CSR055-10 : TPTP v8.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.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 Jun 24 05:04:11 EDT 2024

% Result   : Unsatisfiable 14.53s 14.22s
% Output   : CNFRefutation 14.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  23 unt;   0 nHn;  11 RR)
%            Number of literals    :   23 (  22 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-4 aty)
%            Number of variables   :   26 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax3_41386,axiom,
    ifeq4(disjointwith(X1,X2),true,disjointwith(X2,X1),true) = true,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ax3_41386) ).

cnf(query205,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) = true,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',query205) ).

cnf(ifeq_axiom,axiom,
    ifeq4(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ifeq_axiom) ).

cnf(ax3_10263,axiom,
    ifeq4(disjointwith(X1,X2),true,no(X1,X2),true) = true,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ax3_10263) ).

cnf(ax3_16479,axiom,
    ifeq4(no(X1,X2),true,setorcollection(X2),true) = true,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ax3_16479) ).

cnf(goal,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',goal) ).

cnf(ax3_7665,axiom,
    ifeq2(tuple2(individual(X1),setorcollection(X1)),tuple2(true,true),a,b) = b,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ax3_7665) ).

cnf(ax3_7910,axiom,
    individual(c_xskijump_thegame) = true,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ax3_7910) ).

cnf(ifeq_axiom_002,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p',ifeq_axiom_002) ).

cnf(c_0_9,axiom,
    ifeq4(disjointwith(X1,X2),true,disjointwith(X2,X1),true) = true,
    ax3_41386 ).

cnf(c_0_10,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) = true,
    query205 ).

cnf(c_0_11,axiom,
    ifeq4(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_12,axiom,
    ifeq4(disjointwith(X1,X2),true,no(X1,X2),true) = true,
    ax3_10263 ).

cnf(c_0_13,negated_conjecture,
    disjointwith(c_tptpcol_16_35301,c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,axiom,
    ifeq4(no(X1,X2),true,setorcollection(X2),true) = true,
    ax3_16479 ).

cnf(c_0_15,negated_conjecture,
    no(c_tptpcol_16_35301,c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    a != b,
    inference(fof_simplification,[status(thm)],[goal]) ).

cnf(c_0_17,axiom,
    ifeq2(tuple2(individual(X1),setorcollection(X1)),tuple2(true,true),a,b) = b,
    ax3_7665 ).

cnf(c_0_18,negated_conjecture,
    setorcollection(c_xskijump_thegame) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).

cnf(c_0_19,axiom,
    individual(c_xskijump_thegame) = true,
    ax3_7910 ).

cnf(c_0_20,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    ifeq_axiom_002 ).

cnf(c_0_21,negated_conjecture,
    a != b,
    c_0_16 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : CSR055-10 : TPTP v8.2.0. Released v7.5.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n023.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Wed Jun 19 23:42:54 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 13.20/13.40  Running first-order theorem proving
% 13.20/13.40  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.kJqjWXDwFZ/E---3.1_29627.p
% 14.53/14.22  # Version: 3.2.0
% 14.53/14.22  # Preprocessing class: FMLLSMLLSSSNFFN.
% 14.53/14.22  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.53/14.22  # Starting new_bool_3 with 900s (3) cores
% 14.53/14.22  # Starting new_bool_1 with 900s (3) cores
% 14.53/14.22  # Starting sh5l with 300s (1) cores
% 14.53/14.22  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 14.53/14.22  # sh5l with pid 29935 completed with status 0
% 14.53/14.22  # Result found by sh5l
% 14.53/14.22  # Preprocessing class: FMLLSMLLSSSNFFN.
% 14.53/14.22  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.53/14.22  # Starting new_bool_3 with 900s (3) cores
% 14.53/14.22  # Starting new_bool_1 with 900s (3) cores
% 14.53/14.22  # Starting sh5l with 300s (1) cores
% 14.53/14.22  # SinE strategy is gf500_gu_R04_F100_L20000
% 14.53/14.22  # Search class: FUUPM-FSLM31-MFFFFFNN
% 14.53/14.22  # partial match(1): FUUPM-SSLM31-MFFFFFNN
% 14.53/14.22  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 14.53/14.22  # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 14.53/14.22  # G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29942 completed with status 0
% 14.53/14.22  # Result found by G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 14.53/14.22  # Preprocessing class: FMLLSMLLSSSNFFN.
% 14.53/14.22  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.53/14.22  # Starting new_bool_3 with 900s (3) cores
% 14.53/14.22  # Starting new_bool_1 with 900s (3) cores
% 14.53/14.22  # Starting sh5l with 300s (1) cores
% 14.53/14.22  # SinE strategy is gf500_gu_R04_F100_L20000
% 14.53/14.22  # Search class: FUUPM-FSLM31-MFFFFFNN
% 14.53/14.22  # partial match(1): FUUPM-SSLM31-MFFFFFNN
% 14.53/14.22  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 14.53/14.22  # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 14.53/14.22  # Preprocessing time       : 0.017 s
% 14.53/14.22  # Presaturation interreduction done
% 14.53/14.22  
% 14.53/14.22  # Proof found!
% 14.53/14.22  # SZS status Unsatisfiable
% 14.53/14.22  # SZS output start CNFRefutation
% See solution above
% 14.53/14.22  # Parsed axioms                        : 44219
% 14.53/14.22  # Removed by relevancy pruning/SinE    : 43557
% 14.53/14.22  # Initial clauses                      : 662
% 14.53/14.22  # Removed in clause preprocessing      : 0
% 14.53/14.22  # Initial clauses in saturation        : 662
% 14.53/14.22  # Processed clauses                    : 1304
% 14.53/14.22  # ...of these trivial                  : 220
% 14.53/14.22  # ...subsumed                          : 0
% 14.53/14.22  # ...remaining for further processing  : 1084
% 14.53/14.22  # Other redundant clauses eliminated   : 0
% 14.53/14.22  # Clauses deleted for lack of memory   : 0
% 14.53/14.22  # Backward-subsumed                    : 0
% 14.53/14.22  # Backward-rewritten                   : 0
% 14.53/14.22  # Generated clauses                    : 1263
% 14.53/14.22  # ...of the previous two non-redundant : 940
% 14.53/14.22  # ...aggressively subsumed             : 0
% 14.53/14.22  # Contextual simplify-reflections      : 0
% 14.53/14.22  # Paramodulations                      : 1263
% 14.53/14.22  # Factorizations                       : 0
% 14.53/14.22  # NegExts                              : 0
% 14.53/14.22  # Equation resolutions                 : 0
% 14.53/14.22  # Disequality decompositions           : 0
% 14.53/14.22  # Total rewrite steps                  : 1100
% 14.53/14.22  # ...of those cached                   : 407
% 14.53/14.22  # Propositional unsat checks           : 0
% 14.53/14.22  #    Propositional check models        : 0
% 14.53/14.22  #    Propositional check unsatisfiable : 0
% 14.53/14.22  #    Propositional clauses             : 0
% 14.53/14.22  #    Propositional clauses after purity: 0
% 14.53/14.22  #    Propositional unsat core size     : 0
% 14.53/14.22  #    Propositional preprocessing time  : 0.000
% 14.53/14.22  #    Propositional encoding time       : 0.000
% 14.53/14.22  #    Propositional solver time         : 0.000
% 14.53/14.22  #    Success case prop preproc time    : 0.000
% 14.53/14.22  #    Success case prop encoding time   : 0.000
% 14.53/14.22  #    Success case prop solver time     : 0.000
% 14.53/14.22  # Current number of processed clauses  : 555
% 14.53/14.22  #    Positive orientable unit clauses  : 554
% 14.53/14.22  #    Positive unorientable unit clauses: 0
% 14.53/14.22  #    Negative unit clauses             : 1
% 14.53/14.22  #    Non-unit-clauses                  : 0
% 14.53/14.22  # Current number of unprocessed clauses: 826
% 14.53/14.22  # ...number of literals in the above   : 826
% 14.53/14.22  # Current number of archived formulas  : 0
% 14.53/14.22  # Current number of archived clauses   : 529
% 14.53/14.22  # Clause-clause subsumption calls (NU) : 0
% 14.53/14.22  # Rec. Clause-clause subsumption calls : 0
% 14.53/14.22  # Non-unit clause-clause subsumptions  : 0
% 14.53/14.22  # Unit Clause-clause subsumption calls : 0
% 14.53/14.22  # Rewrite failures with RHS unbound    : 0
% 14.53/14.22  # BW rewrite match attempts            : 476
% 14.53/14.22  # BW rewrite match successes           : 0
% 14.53/14.22  # Condensation attempts                : 0
% 14.53/14.22  # Condensation successes               : 0
% 14.53/14.22  # Termbank termtop insertions          : 354049
% 14.53/14.22  # Search garbage collected termcells   : 124808
% 14.53/14.22  
% 14.53/14.22  # -------------------------------------------------
% 14.53/14.22  # User time                : 0.205 s
% 14.53/14.22  # System time              : 0.096 s
% 14.53/14.22  # Total time               : 0.301 s
% 14.53/14.22  # Maximum resident set size: 78632 pages
% 14.53/14.22  
% 14.53/14.22  # -------------------------------------------------
% 14.53/14.22  # User time                : 0.640 s
% 14.53/14.22  # System time              : 0.128 s
% 14.53/14.22  # Total time               : 0.768 s
% 14.53/14.22  # Maximum resident set size: 30976 pages
% 14.53/14.22  % E---3.1 exiting
% 14.53/14.22  % E exiting
%------------------------------------------------------------------------------