↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR073-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:16:32 PM UTC 2026

% Result   : Unsatisfiable 0.33s 2.81s
% Output   : CNFRefutation 0.33s
% 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/sandbox/benchmark/theBenchmark.p',ax3_2560) ).

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

cnf(ifeq_axiom,axiom,
    ifeq4(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',ax3_11372) ).

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

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

cnf(ifeq_axiom_001,axiom,
    ifeq3(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/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.00/0.04  % Problem  : CSR073-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.09  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.48  % Computer : n004.cluster.edu
% 0.23/0.48  % Model    : x86_64 x86_64
% 0.23/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.48  % Memory   : 8046.5625MB
% 0.23/0.48  % OS       : Linux 6.8.0-71-generic
% 0.23/0.48  % CPULimit : 300
% 0.23/0.48  % WCLimit  : 300
% 0.23/0.48  % DateTime : Mon Sep 21 14:46:19 UTC 2026
% 0.23/0.49  % CPUTime  : 
% 0.23/0.49  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.59  Running first-order theorem proving
% 0.26/0.59  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.33/2.81  % Version: 3.5.1
% 0.33/2.81  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.33/2.81  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 0.33/2.81  % Starting new_bool_3 with 897s (3) cores
% 0.33/2.81  % Starting new_bool_1 with 897s (3) cores
% 0.33/2.81  % Starting sh5l with 299s (1) cores
% 0.33/2.81  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 0.33/2.81  % sh5l with pid 3397985 completed with status 0
% 0.33/2.81  % Result found by sh5l
% 0.33/2.81  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.33/2.81  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 0.33/2.81  % Starting new_bool_3 with 897s (3) cores
% 0.33/2.81  % Starting new_bool_1 with 897s (3) cores
% 0.33/2.81  % Starting sh5l with 299s (1) cores
% 0.33/2.81  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.33/2.81  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.33/2.81  % Search class: FUUPM-FFLM31-DFFFFFNN
% 0.33/2.81  % partial match(1): FUUPM-FFMM31-DFFFFFNN
% 0.33/2.81  % Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 0.33/2.81  % Starting SubtermCWHack with 30s (1) cores
% 0.33/2.81  % SubtermCWHack with pid 3397992 completed with status 0
% 0.33/2.81  % Result found by SubtermCWHack
% 0.33/2.81  % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.33/2.81  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 0.33/2.81  % Starting new_bool_3 with 897s (3) cores
% 0.33/2.81  % Starting new_bool_1 with 897s (3) cores
% 0.33/2.81  % Starting sh5l with 299s (1) cores
% 0.33/2.81  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.33/2.81  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.33/2.81  % Search class: FUUPM-FFLM31-DFFFFFNN
% 0.33/2.81  % partial match(1): FUUPM-FFMM31-DFFFFFNN
% 0.33/2.81  % Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 0.33/2.81  % Starting SubtermCWHack with 30s (1) cores
% 0.33/2.81  % Preprocessing time       : 0.039 s
% 0.33/2.81  
% 0.33/2.81  % Proof found!
% 0.33/2.81  % SZS status Unsatisfiable
% 0.33/2.81  % SZS output start CNFRefutation
% See solution above
% 0.33/2.81  % Parsed axioms                        : 44220
% 0.33/2.81  % Removed by relevancy pruning/SinE    : 43836
% 0.33/2.81  % Initial clauses                      : 384
% 0.33/2.81  % Removed in clause preprocessing      : 0
% 0.33/2.81  % Initial clauses in saturation        : 384
% 0.33/2.81  % Processed clauses                    : 642
% 0.33/2.81  % ...of these trivial                  : 65
% 0.33/2.81  % ...subsumed                          : 0
% 0.33/2.81  % ...remaining for further processing  : 577
% 0.33/2.81  % Other redundant clauses eliminated   : 0
% 0.33/2.81  % Clauses deleted for lack of memory   : 0
% 0.33/2.81  % Backward-subsumed                    : 0
% 0.33/2.81  % Backward-rewritten                   : 0
% 0.33/2.81  % Generated clauses                    : 829
% 0.33/2.81  % ...of the previous two non-redundant : 453
% 0.33/2.81  % ...aggressively subsumed             : 0
% 0.33/2.81  % Contextual simplify-reflections      : 0
% 0.33/2.81  % Paramodulations                      : 829
% 0.33/2.81  % Factorizations                       : 0
% 0.33/2.81  % NegExts                              : 0
% 0.33/2.81  % Equation resolutions                 : 0
% 0.33/2.81  % Disequality decompositions           : 0
% 0.33/2.81  % Total rewrite steps                  : 760
% 0.33/2.81  % ...of those cached                   : 508
% 0.33/2.81  % Propositional unsat checks           : 0
% 0.33/2.81  %    Propositional check models        : 0
% 0.33/2.81  %    Propositional check unsatisfiable : 0
% 0.33/2.81  %    Propositional clauses             : 0
% 0.33/2.81  %    Propositional clauses after purity: 0
% 0.33/2.81  %    Propositional unsat core size     : 0
% 0.33/2.81  %    Propositional preprocessing time  : 0.000
% 0.33/2.81  %    Propositional encoding time       : 0.000
% 0.33/2.81  %    Propositional solver time         : 0.000
% 0.33/2.81  %    Success case prop preproc time    : 0.000
% 0.33/2.81  %    Success case prop encoding time   : 0.000
% 0.33/2.81  %    Success case prop solver time     : 0.000
% 0.33/2.81  % Current number of processed clauses  : 577
% 0.33/2.81  %    Positive orientable unit clauses  : 576
% 0.33/2.81  %    Positive unorientable unit clauses: 0
% 0.33/2.81  %    Negative unit clauses             : 1
% 0.33/2.81  %    Non-unit-clauses                  : 0
% 0.33/2.81  % Current number of unprocessed clauses: 195
% 0.33/2.81  % ...number of literals in the above   : 195
% 0.33/2.81  % Current number of archived formulas  : 0
% 0.33/2.81  % Current number of archived clauses   : 0
% 0.33/2.81  % Clause-clause subsumption calls (NU) : 0
% 0.33/2.81  % Rec. Clause-clause subsumption calls : 0
% 0.33/2.81  % Non-unit clause-clause subsumptions  : 0
% 0.33/2.81  % Unit Clause-clause subsumption calls : 0
% 0.33/2.81  % Rewrite failures with RHS unbound    : 0
% 0.33/2.81  % BW rewrite match attempts            : 397
% 0.33/2.81  % BW rewrite match successes           : 0
% 0.33/2.81  % Condensation attempts                : 0
% 0.33/2.81  % Condensation successes               : 0
% 0.33/2.81  % Termbank termtop insertions          : 349433
% 0.33/2.81  % Search garbage collected termcells   : 125416
% 0.33/2.81  
% 0.33/2.81  % -------------------------------------------------
% 0.33/2.81  % User time                : 0.366 s
% 0.33/2.81  % System time              : 0.259 s
% 0.33/2.81  % Total time               : 0.625 s
% 0.33/2.81  % Maximum resident set size: 80412 pages
% 0.33/2.81  
% 0.33/2.81  % -------------------------------------------------
% 0.33/2.81  % User time                : 1.716 s
% 0.33/2.81  % System time              : 0.332 s
% 0.33/2.81  % Total time               : 2.049 s
% 0.33/2.81  % Maximum resident set size: 34304 pages
% 0.33/2.81  % E exiting
%------------------------------------------------------------------------------