↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.14s 0.46s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   32 (  13 unt;   0 nHn;  26 RR)
%            Number of literals    :   64 (   0 equ;  36 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   40 (  40 usr;  13 con; 0-2 aty)
%            Number of variables   :   92 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p62_67,negated_conjecture,
    ( ~ p27(X4,X2)
    | ~ p62(X3,X4)
    | ~ p4(X3,X1)
    | p62(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p62_67) ).

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

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

cnf(p63_101,negated_conjecture,
    ( ~ p63(f24(f26(f30(c73,X3),X4),X1),X2)
    | p63(f24(f26(f30(c73,X1),X2),X3),X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p63_101) ).

cnf(p62_100,negated_conjecture,
    p62(f5(c64,f8(f11(f13(c65,f16(f19(f21(c66,c67),c68),c69)),c70),c71)),c72),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p62_100) ).

cnf(not_p63_103,negated_conjecture,
    ( ~ p62(f33(f35(f37(f39(f41(c74,X6),X3),X5),X1),X2),X4)
    | ~ p63(f24(f26(f30(c73,X1),X2),f31(X3,X4)),f28(X5,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p63_103) ).

cnf(p63_69,negated_conjecture,
    p63(f24(f26(f30(c73,f31(c68,c72)),f28(c69,c72)),c70),c71),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p63_69) ).

cnf(p62_97,negated_conjecture,
    ( ~ p62(f5(c64,f16(f19(f21(c66,X1),X3),X4)),X2)
    | p62(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p62_97) ).

cnf(p3_106,negated_conjecture,
    p3(f8(f11(f13(c65,f16(f19(f21(c66,X1),X2),X3)),X4),X5),f16(f19(f21(c66,f33(f35(f37(f39(f41(c74,X1),X2),X3),X4),X5)),f43(f45(f47(f49(f51(c75,X1),X2),X3),X4),X5)),f53(f55(f57(f59(f61(c76,X1),X2),X3),X4),X5))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_106) ).

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

cnf(c_0_10,negated_conjecture,
    ( ~ p27(X4,X2)
    | ~ p62(X3,X4)
    | ~ p4(X3,X1)
    | p62(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p62_67]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p27(X4,X2)
    | ~ p62(X3,X4)
    | ~ p4(X3,X1)
    | p62(X1,X2) ),
    c_0_10 ).

cnf(c_0_12,negated_conjecture,
    p27(X1,X1),
    p27_23 ).

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

cnf(c_0_14,negated_conjecture,
    ( ~ p4(X3,X1)
    | ~ p62(X3,X2)
    | p62(X1,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,negated_conjecture,
    ( ~ p63(f24(f26(f30(c73,X3),X4),X1),X2)
    | p63(f24(f26(f30(c73,X1),X2),X3),X4) ),
    inference(fof_simplification,[status(thm)],[p63_101]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ p3(X5,X2)
    | ~ p2(X4,X1)
    | ~ p62(f5(X4,X5),X3)
    | p62(f5(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    p62(f5(c64,f8(f11(f13(c65,f16(f19(f21(c66,c67),c68),c69)),c70),c71)),c72),
    p62_100 ).

cnf(c_0_19,negated_conjecture,
    ( ~ p62(f33(f35(f37(f39(f41(c74,X6),X3),X5),X1),X2),X4)
    | ~ p63(f24(f26(f30(c73,X1),X2),f31(X3,X4)),f28(X5,X4)) ),
    inference(fof_simplification,[status(thm)],[not_p63_103]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ p63(f24(f26(f30(c73,X3),X4),X1),X2)
    | p63(f24(f26(f30(c73,X1),X2),X3),X4) ),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    p63(f24(f26(f30(c73,f31(c68,c72)),f28(c69,c72)),c70),c71),
    p63_69 ).

cnf(c_0_22,negated_conjecture,
    ( ~ p62(f5(c64,f16(f19(f21(c66,X1),X3),X4)),X2)
    | p62(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p62_97]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p3(f8(f11(f13(c65,f16(f19(f21(c66,c67),c68),c69)),c70),c71),X2)
    | ~ p2(c64,X1)
    | p62(f5(X1,X2),c72) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    p3(f8(f11(f13(c65,f16(f19(f21(c66,X1),X2),X3)),X4),X5),f16(f19(f21(c66,f33(f35(f37(f39(f41(c74,X1),X2),X3),X4),X5)),f43(f45(f47(f49(f51(c75,X1),X2),X3),X4),X5)),f53(f55(f57(f59(f61(c76,X1),X2),X3),X4),X5))),
    p3_106 ).

cnf(c_0_25,negated_conjecture,
    ( ~ p62(f33(f35(f37(f39(f41(c74,X6),X3),X5),X1),X2),X4)
    | ~ p63(f24(f26(f30(c73,X1),X2),f31(X3,X4)),f28(X5,X4)) ),
    c_0_19 ).

cnf(c_0_26,negated_conjecture,
    p63(f24(f26(f30(c73,c70),c71),f31(c68,c72)),f28(c69,c72)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p62(f5(c64,f16(f19(f21(c66,X1),X3),X4)),X2)
    | p62(X1,X2) ),
    c_0_22 ).

cnf(c_0_28,negated_conjecture,
    ( ~ p2(c64,X1)
    | p62(f5(X1,f16(f19(f21(c66,f33(f35(f37(f39(f41(c74,c67),c68),c69),c70),c71)),f43(f45(f47(f49(f51(c75,c67),c68),c69),c70),c71)),f53(f55(f57(f59(f61(c76,c67),c68),c69),c70),c71))),c72) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    p2(X1,X1),
    p2_28 ).

cnf(c_0_30,negated_conjecture,
    ~ p62(f33(f35(f37(f39(f41(c74,X1),c68),c69),c70),c71),c72),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN715-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n003.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:14:17 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42  Running first-order theorem proving
% 0.14/0.42  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
% 0.14/0.46  % Version: 3.5.1
% 0.14/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46  % Starting sh5l with 300s (1) cores
% 0.14/0.46  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4151873 completed with status 0
% 0.14/0.46  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46  % No SInE strategy applied
% 0.14/0.46  % Search class: FHHNM-FFMF22-DFFFFFNN
% 0.14/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.46  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 4151880 completed with status 0
% 0.14/0.46  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.46  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46  % No SInE strategy applied
% 0.14/0.46  % Search class: FHHNM-FFMF22-DFFFFFNN
% 0.14/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.46  % Preprocessing time       : 0.001 s
% 0.14/0.46  % Presaturation interreduction done
% 0.14/0.46  
% 0.14/0.46  % Proof found!
% 0.14/0.46  % SZS status Unsatisfiable
% 0.14/0.46  % SZS output start CNFRefutation
% See solution above
% 0.14/0.46  % Parsed axioms                        : 106
% 0.14/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.46  % Initial clauses                      : 106
% 0.14/0.46  % Removed in clause preprocessing      : 0
% 0.14/0.46  % Initial clauses in saturation        : 106
% 0.14/0.46  % Processed clauses                    : 300
% 0.14/0.46  % ...of these trivial                  : 0
% 0.14/0.46  % ...subsumed                          : 5
% 0.14/0.46  % ...remaining for further processing  : 295
% 0.14/0.46  % Other redundant clauses eliminated   : 0
% 0.14/0.46  % Clauses deleted for lack of memory   : 0
% 0.14/0.46  % Backward-subsumed                    : 0
% 0.14/0.46  % Backward-rewritten                   : 0
% 0.14/0.46  % Generated clauses                    : 244
% 0.14/0.46  % ...of the previous two non-redundant : 204
% 0.14/0.46  % ...aggressively subsumed             : 0
% 0.14/0.46  % Contextual simplify-reflections      : 0
% 0.14/0.46  % Paramodulations                      : 244
% 0.14/0.46  % Factorizations                       : 0
% 0.14/0.46  % NegExts                              : 0
% 0.14/0.46  % Equation resolutions                 : 0
% 0.14/0.46  % Disequality decompositions           : 0
% 0.14/0.46  % Total rewrite steps                  : 37
% 0.14/0.46  % ...of those cached                   : 0
% 0.14/0.46  % Propositional unsat checks           : 0
% 0.14/0.46  %    Propositional check models        : 0
% 0.14/0.46  %    Propositional check unsatisfiable : 0
% 0.14/0.46  %    Propositional clauses             : 0
% 0.14/0.46  %    Propositional clauses after purity: 0
% 0.14/0.46  %    Propositional unsat core size     : 0
% 0.14/0.46  %    Propositional preprocessing time  : 0.000
% 0.14/0.46  %    Propositional encoding time       : 0.000
% 0.14/0.46  %    Propositional solver time         : 0.000
% 0.14/0.46  %    Success case prop preproc time    : 0.000
% 0.14/0.46  %    Success case prop encoding time   : 0.000
% 0.14/0.46  %    Success case prop solver time     : 0.000
% 0.14/0.46  % Current number of processed clauses  : 190
% 0.14/0.46  %    Positive orientable unit clauses  : 38
% 0.14/0.46  %    Positive unorientable unit clauses: 0
% 0.14/0.46  %    Negative unit clauses             : 1
% 0.14/0.46  %    Non-unit-clauses                  : 151
% 0.14/0.46  % Current number of unprocessed clauses: 115
% 0.14/0.46  % ...number of literals in the above   : 430
% 0.14/0.46  % Current number of archived formulas  : 0
% 0.14/0.46  % Current number of archived clauses   : 105
% 0.14/0.46  % Clause-clause subsumption calls (NU) : 9312
% 0.14/0.46  % Rec. Clause-clause subsumption calls : 7953
% 0.14/0.46  % Non-unit clause-clause subsumptions  : 5
% 0.14/0.46  % Unit Clause-clause subsumption calls : 0
% 0.14/0.46  % Rewrite failures with RHS unbound    : 0
% 0.14/0.46  % BW rewrite match attempts            : 0
% 0.14/0.46  % BW rewrite match successes           : 0
% 0.14/0.46  % Condensation attempts                : 0
% 0.14/0.46  % Condensation successes               : 0
% 0.14/0.46  % Termbank termtop insertions          : 8686
% 0.14/0.46  % Search garbage collected termcells   : 355
% 0.14/0.46  
% 0.14/0.46  % -------------------------------------------------
% 0.14/0.46  % User time                : 0.013 s
% 0.14/0.46  % System time              : 0.006 s
% 0.14/0.46  % Total time               : 0.019 s
% 0.14/0.46  % Maximum resident set size: 3756 pages
% 0.14/0.46  
% 0.14/0.46  % -------------------------------------------------
% 0.14/0.46  % User time                : 0.054 s
% 0.14/0.46  % System time              : 0.018 s
% 0.14/0.46  % Total time               : 0.073 s
% 0.14/0.46  % Maximum resident set size: 4864 pages
% 0.14/0.46  % E exiting
%------------------------------------------------------------------------------