↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN703-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 : n011.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 0.17s 0.46s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   33 (  13 unt;   0 nHn;  24 RR)
%            Number of literals    :   68 (   0 equ;  39 neg)
%            Maximal clause size   :    5 (   2 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   :   88 (  21 sgn)

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

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

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

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

cnf(p3_80,negated_conjecture,
    p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,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_75,negated_conjecture,
    ( ~ p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2)
    | p47(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p47_75) ).

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

cnf(not_p47_51,negated_conjecture,
    ~ p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p47_51) ).

cnf(p47_76,negated_conjecture,
    ( ~ p47(X1,X4)
    | p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p47_76) ).

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

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

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

cnf(c_0_12,negated_conjecture,
    ( ~ p15(X4,X2)
    | ~ p47(X3,X4)
    | ~ p4(X3,X1)
    | p47(X1,X2) ),
    c_0_10 ).

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

cnf(c_0_14,negated_conjecture,
    ( ~ p15(X6,X3)
    | ~ p2(X4,X1)
    | ~ p3(X5,X2)
    | ~ p47(f5(X4,X5),X6)
    | p47(f5(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_16,negated_conjecture,
    ( ~ p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2)
    | p47(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p47_74]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ p15(c53,X3)
    | ~ p2(c48,X1)
    | ~ p3(f16(f18(c54,f8(f11(f13(c49,c50),c51),c52)),c55),X2)
    | p47(f5(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,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_19,negated_conjecture,
    ( ~ p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2)
    | p47(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p47_75]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2)
    | p47(X1,X2) ),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    ( ~ p15(c53,X2)
    | ~ p2(c48,X1)
    | p47(f5(X1,f8(f11(f13(c49,f20(f22(f24(f26(c56,c50),c51),c52),c55)),f30(f32(f34(f36(c57,c50),c51),c52),c55)),f40(f42(f44(f46(c58,c50),c51),c52),c55))),X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    p2(X1,X1),
    p2_8 ).

cnf(c_0_23,negated_conjecture,
    ~ p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53),
    inference(fof_simplification,[status(thm)],[not_p47_51]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p47(X1,X4)
    | p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4) ),
    inference(fof_simplification,[status(thm)],[p47_76]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2)
    | p47(X1,X2) ),
    c_0_19 ).

cnf(c_0_26,negated_conjecture,
    ( ~ p15(c53,X1)
    | p47(f20(f22(f24(f26(c56,c50),c51),c52),c55),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_27,negated_conjecture,
    ~ p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53),
    c_0_23 ).

cnf(c_0_28,negated_conjecture,
    ( ~ p47(X1,X4)
    | p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4) ),
    c_0_24 ).

cnf(c_0_29,negated_conjecture,
    ( ~ p15(c53,X1)
    | p47(c50,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    p15(X1,X1),
    p15_5 ).

cnf(c_0_31,negated_conjecture,
    ~ p47(c50,c53),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN703-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.11/0.38  % Computer : n011.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 11:13:12 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.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.17/0.46  % Version: 3.5.1
% 0.17/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  % Starting sh5l with 300s (1) cores
% 0.17/0.46  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1757829 completed with status 0
% 0.17/0.46  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.46  % No SInE strategy applied
% 0.17/0.46  % Search class: FHUNM-FFMF22-DFFFFFNN
% 0.17/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.17/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.17/0.46  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1757835 completed with status 0
% 0.17/0.46  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.46  % No SInE strategy applied
% 0.17/0.46  % Search class: FHUNM-FFMF22-DFFFFFNN
% 0.17/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.46  % Preprocessing time       : 0.001 s
% 0.17/0.46  % Presaturation interreduction done
% 0.17/0.46  
% 0.17/0.46  % Proof found!
% 0.17/0.46  % SZS status Unsatisfiable
% 0.17/0.46  % SZS output start CNFRefutation
% See solution above
% 0.17/0.46  % Parsed axioms                        : 80
% 0.17/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.17/0.46  % Initial clauses                      : 80
% 0.17/0.46  % Removed in clause preprocessing      : 0
% 0.17/0.46  % Initial clauses in saturation        : 80
% 0.17/0.46  % Processed clauses                    : 359
% 0.17/0.46  % ...of these trivial                  : 0
% 0.17/0.46  % ...subsumed                          : 69
% 0.17/0.46  % ...remaining for further processing  : 290
% 0.17/0.46  % Other redundant clauses eliminated   : 0
% 0.17/0.46  % Clauses deleted for lack of memory   : 0
% 0.17/0.46  % Backward-subsumed                    : 0
% 0.17/0.46  % Backward-rewritten                   : 0
% 0.17/0.46  % Generated clauses                    : 392
% 0.17/0.46  % ...of the previous two non-redundant : 361
% 0.17/0.46  % ...aggressively subsumed             : 0
% 0.17/0.46  % Contextual simplify-reflections      : 0
% 0.17/0.46  % Paramodulations                      : 392
% 0.17/0.46  % Factorizations                       : 0
% 0.17/0.46  % NegExts                              : 0
% 0.17/0.46  % Equation resolutions                 : 0
% 0.17/0.46  % Disequality decompositions           : 0
% 0.17/0.46  % Total rewrite steps                  : 29
% 0.17/0.46  % ...of those cached                   : 0
% 0.17/0.46  % Propositional unsat checks           : 0
% 0.17/0.46  %    Propositional check models        : 0
% 0.17/0.46  %    Propositional check unsatisfiable : 0
% 0.17/0.46  %    Propositional clauses             : 0
% 0.17/0.46  %    Propositional clauses after purity: 0
% 0.17/0.46  %    Propositional unsat core size     : 0
% 0.17/0.46  %    Propositional preprocessing time  : 0.000
% 0.17/0.46  %    Propositional encoding time       : 0.000
% 0.17/0.46  %    Propositional solver time         : 0.000
% 0.17/0.46  %    Success case prop preproc time    : 0.000
% 0.17/0.46  %    Success case prop encoding time   : 0.000
% 0.17/0.46  %    Success case prop solver time     : 0.000
% 0.17/0.46  % Current number of processed clauses  : 210
% 0.17/0.46  %    Positive orientable unit clauses  : 28
% 0.17/0.47  %    Positive unorientable unit clauses: 0
% 0.17/0.47  %    Negative unit clauses             : 3
% 0.17/0.47  %    Non-unit-clauses                  : 179
% 0.17/0.47  % Current number of unprocessed clauses: 162
% 0.17/0.47  % ...number of literals in the above   : 809
% 0.17/0.47  % Current number of archived formulas  : 0
% 0.17/0.47  % Current number of archived clauses   : 80
% 0.17/0.47  % Clause-clause subsumption calls (NU) : 14210
% 0.17/0.47  % Rec. Clause-clause subsumption calls : 9556
% 0.17/0.47  % Non-unit clause-clause subsumptions  : 69
% 0.17/0.47  % Unit Clause-clause subsumption calls : 14
% 0.17/0.47  % Rewrite failures with RHS unbound    : 0
% 0.17/0.47  % BW rewrite match attempts            : 0
% 0.17/0.47  % BW rewrite match successes           : 0
% 0.17/0.47  % Condensation attempts                : 0
% 0.17/0.47  % Condensation successes               : 0
% 0.17/0.47  % Termbank termtop insertions          : 10585
% 0.17/0.47  % Search garbage collected termcells   : 264
% 0.17/0.47  
% 0.17/0.47  % -------------------------------------------------
% 0.17/0.47  % User time                : 0.018 s
% 0.17/0.47  % System time              : 0.004 s
% 0.17/0.47  % Total time               : 0.022 s
% 0.17/0.47  % Maximum resident set size: 3720 pages
% 0.17/0.47  
% 0.17/0.47  % -------------------------------------------------
% 0.17/0.47  % User time                : 0.070 s
% 0.17/0.47  % System time              : 0.017 s
% 0.17/0.47  % Total time               : 0.087 s
% 0.17/0.47  % Maximum resident set size: 4864 pages
% 0.17/0.47  % E exiting
%------------------------------------------------------------------------------