TSTP Solution File: CSR073-10 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n019.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:05 EDT 2024

% Result   : Unsatisfiable 1.84s 1.27s
% Output   : CNFRefutation 1.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;  10 RR)
%            Number of literals    :   24 (  23 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   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   :   30 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax3_2560,axiom,
    ifeq4(tptptypes_9_401(X1,X2),true,tptptypes_8_400(X2,X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_2560) ).

cnf(ax3_27254,axiom,
    tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_27254) ).

cnf(ifeq_axiom,axiom,
    ifeq4(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(ax3_26515,axiom,
    ifeq4(tptptypes_8_400(X1,X2),true,tptptypes_7_396(X1,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_26515) ).

cnf(ax3_16571,axiom,
    ifeq4(tptptypes_7_396(X1,X2),true,tptptypes_6_388(X1,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_16571) ).

cnf(ax3_11372,axiom,
    ifeq4(tptptypes_6_388(X1,X2),true,tptptypes_5_387(X1,X2),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_11372) ).

cnf(goal,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(query223_1,negated_conjecture,
    ifeq3(tptptypes_5_387(X1,c_pushingababycarriage),true,a,b) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query223_1) ).

cnf(ifeq_axiom_001,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).

cnf(c_0_9,axiom,
    ifeq4(tptptypes_9_401(X1,X2),true,tptptypes_8_400(X2,X1),true) = true,
    ax3_2560 ).

cnf(c_0_10,axiom,
    tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612) = true,
    ax3_27254 ).

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

cnf(c_0_12,axiom,
    ifeq4(tptptypes_8_400(X1,X2),true,tptptypes_7_396(X1,X2),true) = true,
    ax3_26515 ).

cnf(c_0_13,plain,
    tptptypes_8_400(c_tptpcol_16_9612,c_pushingababycarriage) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,axiom,
    ifeq4(tptptypes_7_396(X1,X2),true,tptptypes_6_388(X1,X2),true) = true,
    ax3_16571 ).

cnf(c_0_15,plain,
    tptptypes_7_396(c_tptpcol_16_9612,c_pushingababycarriage) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11]) ).

cnf(c_0_16,axiom,
    ifeq4(tptptypes_6_388(X1,X2),true,tptptypes_5_387(X1,X2),true) = true,
    ax3_11372 ).

cnf(c_0_17,plain,
    tptptypes_6_388(c_tptpcol_16_9612,c_pushingababycarriage) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).

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

cnf(c_0_19,negated_conjecture,
    ifeq3(tptptypes_5_387(X1,c_pushingababycarriage),true,a,b) = b,
    query223_1 ).

cnf(c_0_20,plain,
    tptptypes_5_387(c_tptpcol_16_9612,c_pushingababycarriage) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]) ).

cnf(c_0_21,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    ifeq_axiom_001 ).

cnf(c_0_22,negated_conjecture,
    a != b,
    c_0_18 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : CSR073-10 : TPTP v8.2.0. Released v7.5.0.
% 0.14/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n019.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun May 19 00:58:53 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  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
% 1.84/1.27  # Version: 3.1.0
% 1.84/1.27  # Preprocessing class: FMLLSMLLSSSNFFN.
% 1.84/1.27  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/1.27  # Starting new_bool_3 with 900s (3) cores
% 1.84/1.27  # Starting new_bool_1 with 900s (3) cores
% 1.84/1.27  # Starting sh5l with 300s (1) cores
% 1.84/1.27  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.84/1.27  # sh5l with pid 18931 completed with status 0
% 1.84/1.27  # Result found by sh5l
% 1.84/1.27  # Preprocessing class: FMLLSMLLSSSNFFN.
% 1.84/1.27  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/1.27  # Starting new_bool_3 with 900s (3) cores
% 1.84/1.27  # Starting new_bool_1 with 900s (3) cores
% 1.84/1.27  # Starting sh5l with 300s (1) cores
% 1.84/1.27  # SinE strategy is gf500_gu_R04_F100_L20000
% 1.84/1.27  # Search class: FUUPM-FFLM31-DFFFFFNN
% 1.84/1.27  # partial match(1): FUUPM-FFMM31-DFFFFFNN
% 1.84/1.27  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.84/1.27  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 75s (1) cores
% 1.84/1.27  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 18962 completed with status 0
% 1.84/1.27  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.84/1.27  # Preprocessing class: FMLLSMLLSSSNFFN.
% 1.84/1.27  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/1.27  # Starting new_bool_3 with 900s (3) cores
% 1.84/1.27  # Starting new_bool_1 with 900s (3) cores
% 1.84/1.27  # Starting sh5l with 300s (1) cores
% 1.84/1.27  # SinE strategy is gf500_gu_R04_F100_L20000
% 1.84/1.27  # Search class: FUUPM-FFLM31-DFFFFFNN
% 1.84/1.27  # partial match(1): FUUPM-FFMM31-DFFFFFNN
% 1.84/1.27  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.84/1.27  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 75s (1) cores
% 1.84/1.27  # Preprocessing time       : 0.015 s
% 1.84/1.27  # Presaturation interreduction done
% 1.84/1.27  
% 1.84/1.27  # Proof found!
% 1.84/1.27  # SZS status Unsatisfiable
% 1.84/1.27  # SZS output start CNFRefutation
% See solution above
% 1.84/1.27  # Parsed axioms                        : 44220
% 1.84/1.27  # Removed by relevancy pruning/SinE    : 43836
% 1.84/1.27  # Initial clauses                      : 384
% 1.84/1.27  # Removed in clause preprocessing      : 0
% 1.84/1.27  # Initial clauses in saturation        : 384
% 1.84/1.27  # Processed clauses                    : 718
% 1.84/1.27  # ...of these trivial                  : 70
% 1.84/1.27  # ...subsumed                          : 0
% 1.84/1.27  # ...remaining for further processing  : 648
% 1.84/1.27  # Other redundant clauses eliminated   : 0
% 1.84/1.27  # Clauses deleted for lack of memory   : 0
% 1.84/1.27  # Backward-subsumed                    : 0
% 1.84/1.27  # Backward-rewritten                   : 0
% 1.84/1.27  # Generated clauses                    : 462
% 1.84/1.27  # ...of the previous two non-redundant : 335
% 1.84/1.27  # ...aggressively subsumed             : 0
% 1.84/1.27  # Contextual simplify-reflections      : 0
% 1.84/1.27  # Paramodulations                      : 462
% 1.84/1.27  # Factorizations                       : 0
% 1.84/1.27  # NegExts                              : 0
% 1.84/1.27  # Equation resolutions                 : 0
% 1.84/1.27  # Disequality decompositions           : 0
% 1.84/1.27  # Total rewrite steps                  : 364
% 1.84/1.27  # ...of those cached                   : 193
% 1.84/1.27  # Propositional unsat checks           : 0
% 1.84/1.27  #    Propositional check models        : 0
% 1.84/1.27  #    Propositional check unsatisfiable : 0
% 1.84/1.27  #    Propositional clauses             : 0
% 1.84/1.27  #    Propositional clauses after purity: 0
% 1.84/1.27  #    Propositional unsat core size     : 0
% 1.84/1.27  #    Propositional preprocessing time  : 0.000
% 1.84/1.27  #    Propositional encoding time       : 0.000
% 1.84/1.27  #    Propositional solver time         : 0.000
% 1.84/1.27  #    Success case prop preproc time    : 0.000
% 1.84/1.27  #    Success case prop encoding time   : 0.000
% 1.84/1.27  #    Success case prop solver time     : 0.000
% 1.84/1.27  # Current number of processed clauses  : 318
% 1.84/1.27  #    Positive orientable unit clauses  : 317
% 1.84/1.27  #    Positive unorientable unit clauses: 0
% 1.84/1.27  #    Negative unit clauses             : 1
% 1.84/1.27  #    Non-unit-clauses                  : 0
% 1.84/1.27  # Current number of unprocessed clauses: 330
% 1.84/1.27  # ...number of literals in the above   : 330
% 1.84/1.27  # Current number of archived formulas  : 0
% 1.84/1.27  # Current number of archived clauses   : 330
% 1.84/1.27  # Clause-clause subsumption calls (NU) : 0
% 1.84/1.27  # Rec. Clause-clause subsumption calls : 0
% 1.84/1.27  # Non-unit clause-clause subsumptions  : 0
% 1.84/1.27  # Unit Clause-clause subsumption calls : 0
% 1.84/1.27  # Rewrite failures with RHS unbound    : 0
% 1.84/1.27  # BW rewrite match attempts            : 443
% 1.84/1.27  # BW rewrite match successes           : 0
% 1.84/1.27  # Condensation attempts                : 0
% 1.84/1.27  # Condensation successes               : 0
% 1.84/1.27  # Termbank termtop insertions          : 343358
% 1.84/1.27  # Search garbage collected termcells   : 125416
% 1.84/1.27  
% 1.84/1.27  # -------------------------------------------------
% 1.84/1.27  # User time                : 0.170 s
% 1.84/1.27  # System time              : 0.101 s
% 1.84/1.27  # Total time               : 0.272 s
% 1.84/1.27  # Maximum resident set size: 77932 pages
% 1.84/1.27  
% 1.84/1.27  # -------------------------------------------------
% 1.84/1.27  # User time                : 0.621 s
% 1.84/1.27  # System time              : 0.126 s
% 1.84/1.27  # Total time               : 0.747 s
% 1.84/1.27  # Maximum resident set size: 30288 pages
% 1.84/1.27  % E---3.1 exiting
%------------------------------------------------------------------------------