↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYN619-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 : n007.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:35:22 PM UTC 2026

% Result   : Unsatisfiable 0.18s 5.53s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  12 unt;  16 nHn;  30 RR)
%            Number of literals    :   71 (   0 equ;  27 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   7 con; 0-2 aty)
%            Number of variables   :   31 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p18_27,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p17(f3(c21),f15(X1))
    | p18(X1,f6(c19)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_27) ).

cnf(p18_33,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))
    | p18(X1,f6(c19)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_33) ).

cnf(p18_24,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p2(f14(X1),c20)
    | p18(X1,f6(c19)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_24) ).

cnf(p17_9,negated_conjecture,
    ( ~ p17(f3(X1),X2)
    | p17(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_9) ).

cnf(p18_7,negated_conjecture,
    p18(c24,f6(c25)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_7) ).

cnf(not_p2_32,negated_conjecture,
    ( ~ p8(c24,f9(f13(X1,X2),X3))
    | ~ p17(c21,X2)
    | ~ p2(X1,c20) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p2_32) ).

cnf(p18_34,negated_conjecture,
    ( ~ p18(X1,f6(c19))
    | p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))
    | p18(X1,f6(f7(c22,c23))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18_34) ).

cnf(not_p18_8,negated_conjecture,
    ~ p18(c24,f6(f7(c22,c23))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p18_8) ).

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

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

cnf(c_0_10,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p17(f3(c21),f15(X1))
    | p18(X1,f6(c19)) ),
    inference(fof_simplification,[status(thm)],[p18_27]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))
    | p18(X1,f6(c19)) ),
    inference(fof_simplification,[status(thm)],[p18_33]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p2(f14(X1),c20)
    | p18(X1,f6(c19)) ),
    inference(fof_simplification,[status(thm)],[p18_24]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ p17(f3(X1),X2)
    | p17(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p17_9]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p17(f3(c21),f15(X1))
    | p18(X1,f6(c19)) ),
    c_0_10 ).

cnf(c_0_15,negated_conjecture,
    p18(c24,f6(c25)),
    p18_7 ).

cnf(c_0_16,negated_conjecture,
    ( ~ p8(c24,f9(f13(X1,X2),X3))
    | ~ p17(c21,X2)
    | ~ p2(X1,c20) ),
    inference(fof_simplification,[status(thm)],[not_p2_32]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))
    | p18(X1,f6(c19)) ),
    c_0_11 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p18(X1,f6(c25))
    | p2(f14(X1),c20)
    | p18(X1,f6(c19)) ),
    c_0_12 ).

cnf(c_0_19,negated_conjecture,
    ( ~ p17(f3(X1),X2)
    | p17(X1,X2) ),
    c_0_13 ).

cnf(c_0_20,negated_conjecture,
    ( p17(f3(c21),f15(c24))
    | p18(c24,f6(c19)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ p18(X1,f6(c19))
    | p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))
    | p18(X1,f6(f7(c22,c23))) ),
    inference(fof_simplification,[status(thm)],[p18_34]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p8(c24,f9(f13(X1,X2),X3))
    | ~ p17(c21,X2)
    | ~ p2(X1,c20) ),
    c_0_16 ).

cnf(c_0_23,negated_conjecture,
    ( p8(c24,f9(f13(f14(c24),f15(c24)),f16(c24)))
    | p18(c24,f6(c19)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ( p2(f14(c24),c20)
    | p18(c24,f6(c19)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    ( p17(c21,f15(c24))
    | p18(c24,f6(c19)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    ~ p18(c24,f6(f7(c22,c23))),
    inference(fof_simplification,[status(thm)],[not_p18_8]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p18(X1,f6(c19))
    | p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))
    | p18(X1,f6(f7(c22,c23))) ),
    c_0_21 ).

cnf(c_0_28,negated_conjecture,
    p18(c24,f6(c19)),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    ~ p18(c24,f6(f7(c22,c23))),
    c_0_26 ).

cnf(c_0_30,negated_conjecture,
    p8(c24,f9(f13(c20,c21),f11(f12(f7(c22,c23))))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_31,negated_conjecture,
    p17(X1,X1),
    p17_6 ).

cnf(c_0_32,negated_conjecture,
    p2(X1,X1),
    p2_5 ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN619-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.13/5.41  % Computer : n007.cluster.edu
% 0.13/5.41  % Model    : x86_64 x86_64
% 0.13/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.41  % Memory   : 8046.5625MB
% 0.13/5.41  % OS       : Linux 6.8.0-71-generic
% 0.13/5.41  % CPULimit : 300
% 0.13/5.41  % WCLimit  : 300
% 0.13/5.41  % DateTime : Mon Sep 21 11:08:11 UTC 2026
% 0.13/5.42  % CPUTime  : 
% 0.13/5.42  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.47  Running first-order theorem proving
% 0.13/5.47  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.18/5.53  % Version: 3.5.1
% 0.18/5.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/5.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/5.53  % Starting new_bool_3 with 300s (1) cores
% 0.18/5.53  % Starting new_bool_1 with 300s (1) cores
% 0.18/5.53  % Starting sh5l with 300s (1) cores
% 0.18/5.53  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 937829 completed with status 0
% 0.18/5.53  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/5.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/5.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/5.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/5.53  % No SInE strategy applied
% 0.18/5.53  % Search class: FGHNM-FFMF21-MFFFFFNN
% 0.18/5.53  % partial match(1): FGHNM-FFMF21-SFFFFFNN
% 0.18/5.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/5.53  % Starting SubtermCWHack with 136s (1) cores
% 0.18/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/5.53  % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 231s (1) cores
% 0.18/5.53  % Starting new_bool_3 with 211s (1) cores
% 0.18/5.53  % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.18/5.53  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 937837 completed with status 0
% 0.18/5.53  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/5.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/5.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/5.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/5.53  % No SInE strategy applied
% 0.18/5.53  % Search class: FGHNM-FFMF21-MFFFFFNN
% 0.18/5.53  % partial match(1): FGHNM-FFMF21-SFFFFFNN
% 0.18/5.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/5.53  % Starting SubtermCWHack with 136s (1) cores
% 0.18/5.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/5.53  % Preprocessing time       : 0.002 s
% 0.18/5.53  % Presaturation interreduction done
% 0.18/5.53  
% 0.18/5.53  % Proof found!
% 0.18/5.53  % SZS status Unsatisfiable
% 0.18/5.53  % SZS output start CNFRefutation
% See solution above
% 0.18/5.53  % Parsed axioms                        : 34
% 0.18/5.53  % Removed by relevancy pruning/SinE    : 0
% 0.18/5.53  % Initial clauses                      : 34
% 0.18/5.53  % Removed in clause preprocessing      : 0
% 0.18/5.53  % Initial clauses in saturation        : 34
% 0.18/5.53  % Processed clauses                    : 93
% 0.18/5.53  % ...of these trivial                  : 0
% 0.18/5.53  % ...subsumed                          : 4
% 0.18/5.53  % ...remaining for further processing  : 89
% 0.18/5.53  % Other redundant clauses eliminated   : 0
% 0.18/5.53  % Clauses deleted for lack of memory   : 0
% 0.18/5.53  % Backward-subsumed                    : 0
% 0.18/5.53  % Backward-rewritten                   : 7
% 0.18/5.53  % Generated clauses                    : 85
% 0.18/5.53  % ...of the previous two non-redundant : 74
% 0.18/5.53  % ...aggressively subsumed             : 0
% 0.18/5.53  % Contextual simplify-reflections      : 2
% 0.18/5.53  % Paramodulations                      : 85
% 0.18/5.53  % Factorizations                       : 0
% 0.18/5.53  % NegExts                              : 0
% 0.18/5.53  % Equation resolutions                 : 0
% 0.18/5.53  % Disequality decompositions           : 0
% 0.18/5.53  % Total rewrite steps                  : 17
% 0.18/5.53  % ...of those cached                   : 9
% 0.18/5.53  % Propositional unsat checks           : 0
% 0.18/5.53  %    Propositional check models        : 0
% 0.18/5.53  %    Propositional check unsatisfiable : 0
% 0.18/5.53  %    Propositional clauses             : 0
% 0.18/5.53  %    Propositional clauses after purity: 0
% 0.18/5.53  %    Propositional unsat core size     : 0
% 0.18/5.53  %    Propositional preprocessing time  : 0.000
% 0.18/5.53  %    Propositional encoding time       : 0.000
% 0.18/5.53  %    Propositional solver time         : 0.000
% 0.18/5.53  %    Success case prop preproc time    : 0.000
% 0.18/5.53  %    Success case prop encoding time   : 0.000
% 0.18/5.53  %    Success case prop solver time     : 0.000
% 0.18/5.53  % Current number of processed clauses  : 49
% 0.18/5.53  %    Positive orientable unit clauses  : 16
% 0.18/5.53  %    Positive unorientable unit clauses: 0
% 0.18/5.53  %    Negative unit clauses             : 1
% 0.18/5.53  %    Non-unit-clauses                  : 32
% 0.18/5.53  % Current number of unprocessed clauses: 46
% 0.18/5.53  % ...number of literals in the above   : 133
% 0.18/5.53  % Current number of archived formulas  : 0
% 0.18/5.53  % Current number of archived clauses   : 40
% 0.18/5.53  % Clause-clause subsumption calls (NU) : 149
% 0.18/5.53  % Rec. Clause-clause subsumption calls : 141
% 0.18/5.53  % Non-unit clause-clause subsumptions  : 6
% 0.18/5.53  % Unit Clause-clause subsumption calls : 9
% 0.18/5.53  % Rewrite failures with RHS unbound    : 0
% 0.18/5.53  % BW rewrite match attempts            : 16
% 0.18/5.53  % BW rewrite match successes           : 1
% 0.18/5.53  % Condensation attempts                : 0
% 0.18/5.53  % Condensation successes               : 0
% 0.18/5.53  % Termbank termtop insertions          : 2459
% 0.18/5.53  % Search garbage collected termcells   : 93
% 0.18/5.53  
% 0.18/5.53  % -------------------------------------------------
% 0.18/5.53  % User time                : 0.010 s
% 0.18/5.53  % System time              : 0.007 s
% 0.18/5.53  % Total time               : 0.018 s
% 0.18/5.53  % Maximum resident set size: 3668 pages
% 0.18/5.53  
% 0.18/5.53  % -------------------------------------------------
% 0.18/5.53  % User time                : 0.047 s
% 0.18/5.53  % System time              : 0.018 s
% 0.18/5.53  % Total time               : 0.064 s
% 0.18/5.53  % Maximum resident set size: 4864 pages
% 0.18/5.53  % E exiting
%------------------------------------------------------------------------------