↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN704-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 : n008.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:56 PM UTC 2026

% Result   : Unsatisfiable 0.37s 0.47s
% Output   : CNFRefutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   38 (  20 unt;   0 nHn;  28 RR)
%            Number of literals    :   70 (   0 equ;  35 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   29 (  29 usr;  11 con; 0-2 aty)
%            Number of variables   :   93 (  15 sgn)

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

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

cnf(p47_53,negated_conjecture,
    ( ~ p4(X3,X1)
    | ~ p7(X4,X2)
    | ~ p47(X3,X4)
    | p47(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p47_53) ).

cnf(p3_80,negated_conjecture,
    p3(f8(f10(c49,f13(f16(f18(c50,X1),X2),X3)),X4),f13(f16(f18(c50,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_80) ).

cnf(p47_77,negated_conjecture,
    p47(f5(c48,f8(f10(c49,f13(f16(f18(c50,c51),c52),c53)),c54)),c55),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p47_77) ).

cnf(p47_74,negated_conjecture,
    ( ~ p47(f5(c48,f13(f16(f18(c50,X1),X3),X4)),X2)
    | p47(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p47_74) ).

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

cnf(p7_29,negated_conjecture,
    ( ~ p7(X3,X2)
    | ~ p7(X3,X1)
    | p7(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7_29) ).

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

cnf(p7_26,negated_conjecture,
    p7(c54,c55),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7_26) ).

cnf(not_p47_52,negated_conjecture,
    ~ p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p47_52) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p4(f5(X1,X2),f5(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p4_58]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p4(f5(X1,X2),f5(X3,X4)) ),
    c_0_11 ).

cnf(c_0_13,negated_conjecture,
    p2(X1,X1),
    p2_20 ).

cnf(c_0_14,negated_conjecture,
    ( ~ p4(X3,X1)
    | ~ p7(X4,X2)
    | ~ p47(X3,X4)
    | p47(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p47_53]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p3(X2,X3)
    | p4(f5(X1,X2),f5(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    p3(f8(f10(c49,f13(f16(f18(c50,X1),X2),X3)),X4),f13(f16(f18(c50,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))),
    p3_80 ).

cnf(c_0_17,negated_conjecture,
    ( ~ p4(X3,X1)
    | ~ p7(X4,X2)
    | ~ p47(X3,X4)
    | p47(X1,X2) ),
    c_0_14 ).

cnf(c_0_18,negated_conjecture,
    p4(f5(X1,f8(f10(c49,f13(f16(f18(c50,X2),X3),X4)),X5)),f5(X1,f13(f16(f18(c50,f20(f22(f24(f26(c56,X2),X3),X4),X5)),f30(f32(f34(f36(c57,X2),X3),X4),X5)),f40(f42(f44(f46(c58,X2),X3),X4),X5)))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p7(X7,X6)
    | ~ p47(f5(X1,f8(f10(c49,f13(f16(f18(c50,X2),X3),X4)),X5)),X7)
    | p47(f5(X1,f13(f16(f18(c50,f20(f22(f24(f26(c56,X2),X3),X4),X5)),f30(f32(f34(f36(c57,X2),X3),X4),X5)),f40(f42(f44(f46(c58,X2),X3),X4),X5))),X6) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    p47(f5(c48,f8(f10(c49,f13(f16(f18(c50,c51),c52),c53)),c54)),c55),
    p47_77 ).

cnf(c_0_21,negated_conjecture,
    ( ~ p47(f5(c48,f13(f16(f18(c50,X1),X3),X4)),X2)
    | p47(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p47_74]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p7(c55,X1)
    | p47(f5(c48,f13(f16(f18(c50,f20(f22(f24(f26(c56,c51),c52),c53),c54)),f30(f32(f34(f36(c57,c51),c52),c53),c54)),f40(f42(f44(f46(c58,c51),c52),c53),c54))),X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    p7(X1,X1),
    p7_3 ).

cnf(c_0_24,negated_conjecture,
    ( ~ p7(X3,X2)
    | ~ p7(X3,X1)
    | p7(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p7_29]) ).

cnf(c_0_25,negated_conjecture,
    p4(X1,X1),
    p4_8 ).

cnf(c_0_26,negated_conjecture,
    ( ~ p47(f5(c48,f13(f16(f18(c50,X1),X3),X4)),X2)
    | p47(X1,X2) ),
    c_0_21 ).

cnf(c_0_27,negated_conjecture,
    p47(f5(c48,f13(f16(f18(c50,f20(f22(f24(f26(c56,c51),c52),c53),c54)),f30(f32(f34(f36(c57,c51),c52),c53),c54)),f40(f42(f44(f46(c58,c51),c52),c53),c54))),c55),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ p7(X3,X2)
    | ~ p7(X3,X1)
    | p7(X1,X2) ),
    c_0_24 ).

cnf(c_0_29,negated_conjecture,
    ( ~ p7(X3,X2)
    | ~ p47(X1,X3)
    | p47(X1,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    p47(f20(f22(f24(f26(c56,c51),c52),c53),c54),c55),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ p7(X2,X1)
    | p7(X1,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_32,negated_conjecture,
    p7(c54,c55),
    p7_26 ).

cnf(c_0_33,negated_conjecture,
    ~ p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4),
    inference(fof_simplification,[status(thm)],[not_p47_52]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p7(c55,X1)
    | p47(f20(f22(f24(f26(c56,c51),c52),c53),c54),X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    p7(c55,c54),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ~ p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4),
    c_0_33 ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN704-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n008.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 11:13:40 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.37/0.47  % Version: 3.5.1
% 0.37/0.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.37/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.37/0.47  % Starting sh5l with 300s (1) cores
% 0.37/0.47  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 845636 completed with status 0
% 0.37/0.47  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.37/0.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.37/0.47  % No SInE strategy applied
% 0.37/0.47  % Search class: FHUNM-FFMF22-DFFFFFNN
% 0.37/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.37/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.37/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.37/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.37/0.47  % Starting new_bool_1 with 136s (1) cores
% 0.37/0.47  % new_bool_3 with pid 845644 completed with status 0
% 0.37/0.47  % Result found by new_bool_3
% 0.37/0.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.37/0.47  % No SInE strategy applied
% 0.37/0.47  % Search class: FHUNM-FFMF22-DFFFFFNN
% 0.37/0.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.47  % Starting SubtermCWHack with 136s (1) cores
% 0.37/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.37/0.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.37/0.47  % Starting new_bool_3 with 136s (1) cores
% 0.37/0.47  % Preprocessing time       : 0.002 s
% 0.37/0.47  % Presaturation interreduction done
% 0.37/0.47  
% 0.37/0.47  % Proof found!
% 0.37/0.47  % SZS status Unsatisfiable
% 0.37/0.47  % SZS output start CNFRefutation
% See solution above
% 0.37/0.47  % Parsed axioms                        : 80
% 0.37/0.47  % Removed by relevancy pruning/SinE    : 0
% 0.37/0.47  % Initial clauses                      : 80
% 0.37/0.47  % Removed in clause preprocessing      : 0
% 0.37/0.47  % Initial clauses in saturation        : 80
% 0.37/0.47  % Processed clauses                    : 472
% 0.37/0.47  % ...of these trivial                  : 39
% 0.37/0.47  % ...subsumed                          : 4
% 0.37/0.47  % ...remaining for further processing  : 429
% 0.37/0.47  % Other redundant clauses eliminated   : 0
% 0.37/0.47  % Clauses deleted for lack of memory   : 0
% 0.37/0.47  % Backward-subsumed                    : 8
% 0.37/0.47  % Backward-rewritten                   : 8
% 0.37/0.47  % Generated clauses                    : 908
% 0.37/0.47  % ...of the previous two non-redundant : 537
% 0.37/0.47  % ...aggressively subsumed             : 0
% 0.37/0.47  % Contextual simplify-reflections      : 0
% 0.37/0.47  % Paramodulations                      : 908
% 0.37/0.47  % Factorizations                       : 0
% 0.37/0.47  % NegExts                              : 0
% 0.37/0.47  % Equation resolutions                 : 0
% 0.37/0.47  % Disequality decompositions           : 0
% 0.37/0.47  % Total rewrite steps                  : 417
% 0.37/0.47  % ...of those cached                   : 188
% 0.37/0.47  % Propositional unsat checks           : 0
% 0.37/0.47  %    Propositional check models        : 0
% 0.37/0.47  %    Propositional check unsatisfiable : 0
% 0.37/0.47  %    Propositional clauses             : 0
% 0.37/0.47  %    Propositional clauses after purity: 0
% 0.37/0.47  %    Propositional unsat core size     : 0
% 0.37/0.47  %    Propositional preprocessing time  : 0.000
% 0.37/0.47  %    Propositional encoding time       : 0.000
% 0.37/0.47  %    Propositional solver time         : 0.000
% 0.37/0.47  %    Success case prop preproc time    : 0.000
% 0.37/0.47  %    Success case prop encoding time   : 0.000
% 0.37/0.47  %    Success case prop solver time     : 0.000
% 0.37/0.47  % Current number of processed clauses  : 333
% 0.37/0.47  %    Positive orientable unit clauses  : 118
% 0.37/0.47  %    Positive unorientable unit clauses: 0
% 0.37/0.47  %    Negative unit clauses             : 1
% 0.37/0.47  %    Non-unit-clauses                  : 214
% 0.37/0.47  % Current number of unprocessed clauses: 225
% 0.37/0.47  % ...number of literals in the above   : 249
% 0.37/0.47  % Current number of archived formulas  : 0
% 0.37/0.47  % Current number of archived clauses   : 96
% 0.37/0.47  % Clause-clause subsumption calls (NU) : 4924
% 0.37/0.47  % Rec. Clause-clause subsumption calls : 4775
% 0.37/0.47  % Non-unit clause-clause subsumptions  : 12
% 0.37/0.47  % Unit Clause-clause subsumption calls : 150
% 0.37/0.47  % Rewrite failures with RHS unbound    : 0
% 0.37/0.47  % BW rewrite match attempts            : 84
% 0.37/0.47  % BW rewrite match successes           : 8
% 0.37/0.47  % Condensation attempts                : 0
% 0.37/0.47  % Condensation successes               : 0
% 0.37/0.47  % Termbank termtop insertions          : 21489
% 0.37/0.47  % Search garbage collected termcells   : 262
% 0.37/0.47  
% 0.37/0.47  % -------------------------------------------------
% 0.37/0.47  % User time                : 0.033 s
% 0.37/0.47  % System time              : 0.009 s
% 0.37/0.47  % Total time               : 0.042 s
% 0.37/0.47  % Maximum resident set size: 3668 pages
% 0.37/0.47  
% 0.37/0.47  % -------------------------------------------------
% 0.37/0.47  % User time                : 0.148 s
% 0.37/0.47  % System time              : 0.028 s
% 0.37/0.47  % Total time               : 0.176 s
% 0.37/0.47  % Maximum resident set size: 4864 pages
% 0.37/0.47  % E exiting
%------------------------------------------------------------------------------