↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n019.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 03:25:54 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(p2_42,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_42) ).

cnf(p2_12,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_12) ).

cnf(p2_55,negated_conjecture,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_55) ).

cnf(not_p2_56,negated_conjecture,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p2_56) ).

cnf(p2_61,negated_conjecture,
    ( ~ p3(X1,X3)
    | ~ p10(X2,X4)
    | p2(f11(X1,X2),f11(X3,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_61) ).

cnf(p3_36,negated_conjecture,
    ( ~ p2(X1,X2)
    | p3(f4(X1),f4(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_36) ).

cnf(p2_18,negated_conjecture,
    p2(c44,c45),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_18) ).

cnf(p10_7,negated_conjecture,
    p10(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_7) ).

cnf(c_0_8,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p2_42]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    c_0_8 ).

cnf(c_0_10,negated_conjecture,
    p2(X1,X1),
    p2_12 ).

cnf(c_0_11,negated_conjecture,
    ( ~ p2(X2,X1)
    | p2(X1,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)),
    p2_55 ).

cnf(c_0_13,negated_conjecture,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(fof_simplification,[status(thm)],[not_p2_56]) ).

cnf(c_0_14,negated_conjecture,
    p2(f11(f4(c44),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p3(X1,X3)
    | ~ p10(X2,X4)
    | p2(f11(X1,X2),f11(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p2_61]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p2(X1,X2)
    | p3(f4(X1),f4(X2)) ),
    inference(fof_simplification,[status(thm)],[p3_36]) ).

cnf(c_0_17,negated_conjecture,
    ~ p2(f11(f4(c45),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p2(f11(f4(c44),c43),X1)
    | p2(X1,f11(f4(f23(c44,f9(f20(c37)))),c43)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p3(X1,X3)
    | ~ p10(X2,X4)
    | p2(f11(X1,X2),f11(X3,X4)) ),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    ( ~ p2(X1,X2)
    | p3(f4(X1),f4(X2)) ),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    ~ p2(f11(f4(c44),c43),f11(f4(c45),c43)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p10(X2,X4)
    | ~ p2(X1,X3)
    | p2(f11(f4(X1),X2),f11(f4(X3),X4)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    p2(c44,c45),
    p2_18 ).

cnf(c_0_24,negated_conjecture,
    p10(X1,X1),
    p10_7 ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN694-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.38  % Computer : n019.cluster.edu
% 0.13/5.38  % Model    : x86_64 x86_64
% 0.13/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38  % Memory   : 8046.5625MB
% 0.13/5.38  % OS       : Linux 6.8.0-71-generic
% 0.13/5.38  % CPULimit : 300
% 0.13/5.38  % WCLimit  : 300
% 0.13/5.38  % DateTime : Mon Sep 21 11:12:58 UTC 2026
% 0.13/5.38  % CPUTime  : 
% 0.13/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.42  Running first-order theorem proving
% 0.16/5.42  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.16/5.55  % Version: 3.5.1
% 0.16/5.55  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.55  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.55  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.55  % Starting sh5l with 300s (1) cores
% 0.16/5.55  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2426247 completed with status 0
% 0.16/5.55  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/5.55  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.55  % No SInE strategy applied
% 0.16/5.55  % Search class: FGHNM-FFMM21-MFFFFFNN
% 0.16/5.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.55  % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/5.55  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/5.55  % Starting new_bool_3 with 136s (1) cores
% 0.16/5.55  % Starting new_bool_1 with 136s (1) cores
% 0.16/5.55  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2426253 completed with status 0
% 0.16/5.55  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/5.55  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/5.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/5.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.55  % No SInE strategy applied
% 0.16/5.55  % Search class: FGHNM-FFMM21-MFFFFFNN
% 0.16/5.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.55  % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.55  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/5.55  % Preprocessing time       : 0.002 s
% 0.16/5.55  % Presaturation interreduction done
% 0.16/5.55  
% 0.16/5.55  % Proof found!
% 0.16/5.55  % SZS status Unsatisfiable
% 0.16/5.55  % SZS output start CNFRefutation
% See solution above
% 0.16/5.55  % Parsed axioms                        : 73
% 0.16/5.55  % Removed by relevancy pruning/SinE    : 0
% 0.16/5.55  % Initial clauses                      : 73
% 0.16/5.55  % Removed in clause preprocessing      : 0
% 0.16/5.55  % Initial clauses in saturation        : 73
% 0.16/5.55  % Processed clauses                    : 998
% 0.16/5.55  % ...of these trivial                  : 0
% 0.16/5.55  % ...subsumed                          : 293
% 0.16/5.55  % ...remaining for further processing  : 705
% 0.16/5.55  % Other redundant clauses eliminated   : 0
% 0.16/5.55  % Clauses deleted for lack of memory   : 0
% 0.16/5.55  % Backward-subsumed                    : 22
% 0.16/5.55  % Backward-rewritten                   : 0
% 0.16/5.55  % Generated clauses                    : 2737
% 0.16/5.55  % ...of the previous two non-redundant : 2599
% 0.16/5.55  % ...aggressively subsumed             : 0
% 0.16/5.55  % Contextual simplify-reflections      : 4
% 0.16/5.55  % Paramodulations                      : 2737
% 0.16/5.55  % Factorizations                       : 0
% 0.16/5.55  % NegExts                              : 0
% 0.16/5.55  % Equation resolutions                 : 0
% 0.16/5.55  % Disequality decompositions           : 0
% 0.16/5.55  % Total rewrite steps                  : 202
% 0.16/5.55  % ...of those cached                   : 164
% 0.16/5.55  % Propositional unsat checks           : 0
% 0.16/5.55  %    Propositional check models        : 0
% 0.16/5.55  %    Propositional check unsatisfiable : 0
% 0.16/5.55  %    Propositional clauses             : 0
% 0.16/5.55  %    Propositional clauses after purity: 0
% 0.16/5.55  %    Propositional unsat core size     : 0
% 0.16/5.55  %    Propositional preprocessing time  : 0.000
% 0.16/5.55  %    Propositional encoding time       : 0.000
% 0.16/5.55  %    Propositional solver time         : 0.000
% 0.16/5.55  %    Success case prop preproc time    : 0.000
% 0.16/5.55  %    Success case prop encoding time   : 0.000
% 0.16/5.55  %    Success case prop solver time     : 0.000
% 0.16/5.55  % Current number of processed clauses  : 610
% 0.16/5.55  %    Positive orientable unit clauses  : 38
% 0.16/5.55  %    Positive unorientable unit clauses: 0
% 0.16/5.55  %    Negative unit clauses             : 8
% 0.16/5.55  %    Non-unit-clauses                  : 564
% 0.16/5.55  % Current number of unprocessed clauses: 1738
% 0.16/5.55  % ...number of literals in the above   : 5902
% 0.16/5.55  % Current number of archived formulas  : 0
% 0.16/5.55  % Current number of archived clauses   : 95
% 0.16/5.55  % Clause-clause subsumption calls (NU) : 69065
% 0.16/5.55  % Rec. Clause-clause subsumption calls : 60378
% 0.16/5.55  % Non-unit clause-clause subsumptions  : 312
% 0.16/5.55  % Unit Clause-clause subsumption calls : 325
% 0.16/5.55  % Rewrite failures with RHS unbound    : 0
% 0.16/5.55  % BW rewrite match attempts            : 12
% 0.16/5.55  % BW rewrite match successes           : 0
% 0.16/5.55  % Condensation attempts                : 0
% 0.16/5.55  % Condensation successes               : 0
% 0.16/5.55  % Termbank termtop insertions          : 39890
% 0.16/5.55  % Search garbage collected termcells   : 200
% 0.16/5.55  
% 0.16/5.55  % -------------------------------------------------
% 0.16/5.55  % User time                : 0.099 s
% 0.16/5.55  % System time              : 0.007 s
% 0.16/5.55  % Total time               : 0.106 s
% 0.16/5.55  % Maximum resident set size: 3708 pages
% 0.16/5.55  
% 0.16/5.55  % -------------------------------------------------
% 0.16/5.55  % User time                : 0.468 s
% 0.16/5.55  % System time              : 0.065 s
% 0.16/5.55  % Total time               : 0.533 s
% 0.16/5.55  % Maximum resident set size: 4608 pages
% 0.16/5.55  % E exiting
%------------------------------------------------------------------------------