↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Computer : n006.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:18:30 PM UTC 2026

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

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

cnf(ax3_9650,axiom,
    genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_9650) ).

cnf(query218,negated_conjecture,
    mtvisible(c_tptp_member2356_mt) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query218) ).

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

cnf(ax3_5580,axiom,
    ifeq4(furpelt(X1),true,ifeq4(mtvisible(c_tptp_spindleheadmt),true,tptpofobject(X1,f_tptpquantityfn_1(n_328)),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_5580) ).

cnf(ax3_10453,axiom,
    furpelt(c_theprototypicalfurpelt) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3_10453) ).

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

cnf(query218_1,negated_conjecture,
    ifeq3(tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)),true,a,b) = b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query218_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(genlmt(X1,X2),true,ifeq4(mtvisible(X1),true,mtvisible(X2),true),true) = true,
    ax3_44208 ).

cnf(c_0_10,axiom,
    genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt) = true,
    ax3_9650 ).

cnf(c_0_11,negated_conjecture,
    mtvisible(c_tptp_member2356_mt) = true,
    query218 ).

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

cnf(c_0_13,axiom,
    ifeq4(furpelt(X1),true,ifeq4(mtvisible(c_tptp_spindleheadmt),true,tptpofobject(X1,f_tptpquantityfn_1(n_328)),true),true) = true,
    ax3_5580 ).

cnf(c_0_14,plain,
    mtvisible(c_tptp_spindleheadmt) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_12]) ).

cnf(c_0_15,plain,
    ifeq4(furpelt(X1),true,tptpofobject(X1,f_tptpquantityfn_1(n_328)),true) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).

cnf(c_0_16,axiom,
    furpelt(c_theprototypicalfurpelt) = true,
    ax3_10453 ).

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

cnf(c_0_18,negated_conjecture,
    ifeq3(tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)),true,a,b) = b,
    query218_1 ).

cnf(c_0_19,plain,
    tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR068-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.59  % Computer : n006.cluster.edu
% 0.11/10.59  % Model    : x86_64 x86_64
% 0.11/10.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.59  % Memory   : 8046.5625MB
% 0.11/10.59  % OS       : Linux 6.8.0-71-generic
% 0.11/10.59  % CPULimit : 300
% 0.11/10.59  % WCLimit  : 300
% 0.11/10.59  % DateTime : Mon Sep 21 14:43:29 UTC 2026
% 0.11/10.60  % CPUTime  : 
% 0.11/10.60  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.67  Running first-order theorem proving
% 0.15/10.67  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/benchmark/theBenchmark.p
% 2.37/12.05  % Version: 3.5.1
% 2.37/12.05  % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.37/12.05  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.37/12.05  % Starting new_bool_3 with 897s (3) cores
% 2.37/12.05  % Starting new_bool_1 with 897s (3) cores
% 2.37/12.05  % Starting sh5l with 299s (1) cores
% 2.37/12.05  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 2.37/12.05  % new_bool_1 with pid 3088403 completed with status 0
% 2.37/12.05  % Result found by new_bool_1
% 2.37/12.05  % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.37/12.05  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.37/12.05  % Starting new_bool_3 with 897s (3) cores
% 2.37/12.05  % Starting new_bool_1 with 897s (3) cores
% 2.37/12.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.37/12.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.37/12.05  % Search class: FUUPM-FFMM31-MFFFFFNN
% 2.37/12.05  % Scheduled 5 strats onto 3 cores with 897 seconds (897 total)
% 2.37/12.05  % Starting SubtermCWHack with 90s (1) cores
% 2.37/12.05  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 539s (1) cores
% 2.37/12.05  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 90s (1) cores
% 2.37/12.05  % SubtermCWHack with pid 3088462 completed with status 0
% 2.37/12.05  % Result found by SubtermCWHack
% 2.37/12.05  % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.37/12.05  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.37/12.05  % Starting new_bool_3 with 897s (3) cores
% 2.37/12.05  % Starting new_bool_1 with 897s (3) cores
% 2.37/12.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.37/12.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.37/12.05  % Search class: FUUPM-FFMM31-MFFFFFNN
% 2.37/12.05  % Scheduled 5 strats onto 3 cores with 897 seconds (897 total)
% 2.37/12.05  % Starting SubtermCWHack with 90s (1) cores
% 2.37/12.05  % Preprocessing time       : 0.020 s
% 2.37/12.05  
% 2.37/12.05  % Proof found!
% 2.37/12.05  % SZS status Unsatisfiable
% 2.37/12.05  % SZS output start CNFRefutation
% See solution above
% 2.37/12.05  % Parsed axioms                        : 44220
% 2.37/12.05  % Removed by relevancy pruning/SinE    : 44144
% 2.37/12.05  % Initial clauses                      : 76
% 2.37/12.05  % Removed in clause preprocessing      : 0
% 2.37/12.05  % Initial clauses in saturation        : 76
% 2.37/12.05  % Processed clauses                    : 111
% 2.37/12.05  % ...of these trivial                  : 14
% 2.37/12.05  % ...subsumed                          : 0
% 2.37/12.05  % ...remaining for further processing  : 97
% 2.37/12.05  % Other redundant clauses eliminated   : 0
% 2.37/12.05  % Clauses deleted for lack of memory   : 0
% 2.37/12.05  % Backward-subsumed                    : 0
% 2.37/12.05  % Backward-rewritten                   : 3
% 2.37/12.05  % Generated clauses                    : 118
% 2.37/12.05  % ...of the previous two non-redundant : 51
% 2.37/12.05  % ...aggressively subsumed             : 0
% 2.37/12.05  % Contextual simplify-reflections      : 0
% 2.37/12.05  % Paramodulations                      : 118
% 2.37/12.05  % Factorizations                       : 0
% 2.37/12.05  % NegExts                              : 0
% 2.37/12.05  % Equation resolutions                 : 0
% 2.37/12.05  % Disequality decompositions           : 0
% 2.37/12.05  % Total rewrite steps                  : 150
% 2.37/12.05  % ...of those cached                   : 89
% 2.37/12.05  % Propositional unsat checks           : 0
% 2.37/12.05  %    Propositional check models        : 0
% 2.37/12.05  %    Propositional check unsatisfiable : 0
% 2.37/12.05  %    Propositional clauses             : 0
% 2.37/12.05  %    Propositional clauses after purity: 0
% 2.37/12.05  %    Propositional unsat core size     : 0
% 2.37/12.05  %    Propositional preprocessing time  : 0.000
% 2.37/12.05  %    Propositional encoding time       : 0.000
% 2.37/12.05  %    Propositional solver time         : 0.000
% 2.37/12.05  %    Success case prop preproc time    : 0.000
% 2.37/12.05  %    Success case prop encoding time   : 0.000
% 2.37/12.05  %    Success case prop solver time     : 0.000
% 2.37/12.05  % Current number of processed clauses  : 94
% 2.37/12.05  %    Positive orientable unit clauses  : 93
% 2.37/12.05  %    Positive unorientable unit clauses: 0
% 2.37/12.05  %    Negative unit clauses             : 1
% 2.37/12.05  %    Non-unit-clauses                  : 0
% 2.37/12.05  % Current number of unprocessed clauses: 16
% 2.37/12.05  % ...number of literals in the above   : 16
% 2.37/12.05  % Current number of archived formulas  : 0
% 2.37/12.05  % Current number of archived clauses   : 3
% 2.37/12.05  % Clause-clause subsumption calls (NU) : 0
% 2.37/12.05  % Rec. Clause-clause subsumption calls : 0
% 2.37/12.05  % Non-unit clause-clause subsumptions  : 0
% 2.37/12.05  % Unit Clause-clause subsumption calls : 0
% 2.37/12.05  % Rewrite failures with RHS unbound    : 0
% 2.37/12.05  % BW rewrite match attempts            : 14
% 2.37/12.05  % BW rewrite match successes           : 3
% 2.37/12.05  % Condensation attempts                : 0
% 2.37/12.05  % Condensation successes               : 0
% 2.37/12.05  % Termbank termtop insertions          : 335805
% 2.37/12.05  % Search garbage collected termcells   : 126199
% 2.37/12.05  
% 2.37/12.05  % -------------------------------------------------
% 2.37/12.05  % User time                : 0.169 s
% 2.37/12.05  % System time              : 0.128 s
% 2.37/12.05  % Total time               : 0.298 s
% 2.37/12.05  % Maximum resident set size: 80412 pages
% 2.37/12.05  
% 2.37/12.05  % -------------------------------------------------
% 2.37/12.05  % User time                : 1.219 s
% 2.37/12.05  % System time              : 0.231 s
% 2.37/12.05  % Total time               : 1.450 s
% 2.37/12.05  % Maximum resident set size: 34560 pages
% 2.37/12.05  % E exiting
%------------------------------------------------------------------------------