↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN700-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/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 03:25:55 PM UTC 2026

% Result   : Unsatisfiable 1.26s 0.80s
% Output   : CNFRefutation 1.26s
% 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_43,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_43) ).

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

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

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

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

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

cnf(p2_16,negated_conjecture,
    p2(c44,c46),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_16) ).

cnf(p10_7,negated_conjecture,
    p10(X1,X1),
    file('/export/starexec/sandbox2/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_43]) ).

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_56 ).

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

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_62]) ).

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

cnf(c_0_17,negated_conjecture,
    ~ p2(f11(f4(c46),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(c46),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,c46),
    p2_16 ).

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.05  % Problem  : SYN700-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.50  % Computer : n004.cluster.edu
% 0.20/0.50  % Model    : x86_64 x86_64
% 0.20/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.50  % Memory   : 8046.5625MB
% 0.20/0.50  % OS       : Linux 6.8.0-71-generic
% 0.20/0.51  % CPULimit : 300
% 0.20/0.51  % WCLimit  : 300
% 0.20/0.51  % DateTime : Mon Sep 21 11:12:21 UTC 2026
% 0.20/0.51  % CPUTime  : 
% 0.20/0.51  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.58  Running first-order theorem proving
% 0.25/0.58  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
% 1.26/0.80  % Version: 3.5.1
% 1.26/0.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.80  % Starting new_bool_3 with 300s (1) cores
% 1.26/0.80  % Starting new_bool_1 with 300s (1) cores
% 1.26/0.80  % Starting sh5l with 300s (1) cores
% 1.26/0.80  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2996634 completed with status 0
% 1.26/0.80  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.26/0.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.80  % No SInE strategy applied
% 1.26/0.80  % Search class: FGHNM-FFMM21-MFFFFFNN
% 1.26/0.80  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.80  % Starting SubtermCWHack with 136s (1) cores
% 1.26/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.26/0.80  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.26/0.80  % Starting new_bool_3 with 136s (1) cores
% 1.26/0.80  % Starting new_bool_1 with 136s (1) cores
% 1.26/0.80  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2996639 completed with status 0
% 1.26/0.80  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.26/0.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.26/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.26/0.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.26/0.80  % No SInE strategy applied
% 1.26/0.80  % Search class: FGHNM-FFMM21-MFFFFFNN
% 1.26/0.80  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.80  % Starting SubtermCWHack with 136s (1) cores
% 1.26/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.26/0.80  % Preprocessing time       : 0.003 s
% 1.26/0.80  % Presaturation interreduction done
% 1.26/0.80  
% 1.26/0.80  % Proof found!
% 1.26/0.80  % SZS status Unsatisfiable
% 1.26/0.80  % SZS output start CNFRefutation
% See solution above
% 1.26/0.80  % Parsed axioms                        : 74
% 1.26/0.80  % Removed by relevancy pruning/SinE    : 0
% 1.26/0.80  % Initial clauses                      : 74
% 1.26/0.80  % Removed in clause preprocessing      : 0
% 1.26/0.80  % Initial clauses in saturation        : 74
% 1.26/0.80  % Processed clauses                    : 1031
% 1.26/0.80  % ...of these trivial                  : 0
% 1.26/0.80  % ...subsumed                          : 339
% 1.26/0.80  % ...remaining for further processing  : 692
% 1.26/0.80  % Other redundant clauses eliminated   : 0
% 1.26/0.80  % Clauses deleted for lack of memory   : 0
% 1.26/0.80  % Backward-subsumed                    : 24
% 1.26/0.80  % Backward-rewritten                   : 0
% 1.26/0.80  % Generated clauses                    : 2948
% 1.26/0.80  % ...of the previous two non-redundant : 2826
% 1.26/0.80  % ...aggressively subsumed             : 0
% 1.26/0.80  % Contextual simplify-reflections      : 4
% 1.26/0.80  % Paramodulations                      : 2948
% 1.26/0.80  % Factorizations                       : 0
% 1.26/0.80  % NegExts                              : 0
% 1.26/0.80  % Equation resolutions                 : 0
% 1.26/0.80  % Disequality decompositions           : 0
% 1.26/0.80  % Total rewrite steps                  : 262
% 1.26/0.80  % ...of those cached                   : 225
% 1.26/0.80  % Propositional unsat checks           : 0
% 1.26/0.80  %    Propositional check models        : 0
% 1.26/0.80  %    Propositional check unsatisfiable : 0
% 1.26/0.80  %    Propositional clauses             : 0
% 1.26/0.80  %    Propositional clauses after purity: 0
% 1.26/0.80  %    Propositional unsat core size     : 0
% 1.26/0.80  %    Propositional preprocessing time  : 0.000
% 1.26/0.80  %    Propositional encoding time       : 0.000
% 1.26/0.80  %    Propositional solver time         : 0.000
% 1.26/0.80  %    Success case prop preproc time    : 0.000
% 1.26/0.80  %    Success case prop encoding time   : 0.000
% 1.26/0.80  %    Success case prop solver time     : 0.000
% 1.26/0.80  % Current number of processed clauses  : 594
% 1.26/0.80  %    Positive orientable unit clauses  : 38
% 1.26/0.80  %    Positive unorientable unit clauses: 0
% 1.26/0.80  %    Negative unit clauses             : 8
% 1.26/0.80  %    Non-unit-clauses                  : 548
% 1.26/0.80  % Current number of unprocessed clauses: 1924
% 1.26/0.80  % ...number of literals in the above   : 6532
% 1.26/0.80  % Current number of archived formulas  : 0
% 1.26/0.80  % Current number of archived clauses   : 98
% 1.26/0.80  % Clause-clause subsumption calls (NU) : 57832
% 1.26/0.80  % Rec. Clause-clause subsumption calls : 49123
% 1.26/0.80  % Non-unit clause-clause subsumptions  : 360
% 1.26/0.80  % Unit Clause-clause subsumption calls : 143
% 1.26/0.80  % Rewrite failures with RHS unbound    : 0
% 1.26/0.80  % BW rewrite match attempts            : 11
% 1.26/0.80  % BW rewrite match successes           : 0
% 1.26/0.80  % Condensation attempts                : 0
% 1.26/0.80  % Condensation successes               : 0
% 1.26/0.80  % Termbank termtop insertions          : 41866
% 1.26/0.80  % Search garbage collected termcells   : 200
% 1.26/0.80  
% 1.26/0.80  % -------------------------------------------------
% 1.26/0.80  % User time                : 0.159 s
% 1.26/0.80  % System time              : 0.011 s
% 1.26/0.80  % Total time               : 0.170 s
% 1.26/0.80  % Maximum resident set size: 3708 pages
% 1.26/0.80  
% 1.26/0.80  % -------------------------------------------------
% 1.26/0.80  % User time                : 0.667 s
% 1.26/0.80  % System time              : 0.058 s
% 1.26/0.80  % Total time               : 0.725 s
% 1.26/0.80  % Maximum resident set size: 4608 pages
% 1.26/0.80  % E exiting
%------------------------------------------------------------------------------