↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   38 (  16 unt;   0 nHn;  34 RR)
%            Number of literals    :   71 (   0 equ;  36 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-5 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :   54 (   4 sgn)

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

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

cnf(p3_9,negated_conjecture,
    p3(c23,f4(f7(c17,c18),c21)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_9) ).

cnf(p3_20,negated_conjecture,
    ( ~ p15(X1,c19)
    | p3(c24,f4(f7(c17,X1),f14(X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_20) ).

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

cnf(p3_28,negated_conjecture,
    ( ~ p16(c17,c20,X3,X1,c22)
    | ~ p16(c17,c20,X3,X2,X4)
    | p3(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_28) ).

cnf(p16_10,negated_conjecture,
    p16(c17,c20,f9(c19,c18),c21,c22),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_10) ).

cnf(p16_23,negated_conjecture,
    ( ~ p15(X1,c19)
    | p16(c17,c20,f9(c19,X1),f14(X1),c25) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_23) ).

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

cnf(p15_7,negated_conjecture,
    p15(c18,c19),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p15_7) ).

cnf(not_p3_8,negated_conjecture,
    ~ p3(c23,c24),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p3_8) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_18]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    c_0_11 ).

cnf(c_0_13,negated_conjecture,
    p3(X1,X1),
    p3_5 ).

cnf(c_0_14,negated_conjecture,
    ( ~ p3(X2,X1)
    | p3(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    p3(c23,f4(f7(c17,c18),c21)),
    p3_9 ).

cnf(c_0_16,negated_conjecture,
    ( ~ p15(X1,c19)
    | p3(c24,f4(f7(c17,X1),f14(X1))) ),
    inference(fof_simplification,[status(thm)],[p3_20]) ).

cnf(c_0_17,negated_conjecture,
    p3(f4(f7(c17,c18),c21),c23),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p3(f4(X1,X2),f4(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p3_27]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p16(c17,c20,X3,X1,c22)
    | ~ p16(c17,c20,X3,X2,X4)
    | p3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_28]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ p15(X1,c19)
    | p3(c24,f4(f7(c17,X1),f14(X1))) ),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    ( ~ p3(f4(f7(c17,c18),c21),X1)
    | p3(X1,c23) ),
    inference(spm,[status(thm)],[c_0_12,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p3(f4(X1,X2),f4(X3,X4)) ),
    c_0_18 ).

cnf(c_0_23,negated_conjecture,
    ( ~ p16(c17,c20,X3,X1,c22)
    | ~ p16(c17,c20,X3,X2,X4)
    | p3(X1,X2) ),
    c_0_19 ).

cnf(c_0_24,negated_conjecture,
    p16(c17,c20,f9(c19,c18),c21,c22),
    p16_10 ).

cnf(c_0_25,negated_conjecture,
    ( ~ p15(X1,c19)
    | p16(c17,c20,f9(c19,X1),f14(X1),c25) ),
    inference(fof_simplification,[status(thm)],[p16_23]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ p15(X1,c19)
    | p3(f4(f7(c17,X1),f14(X1)),c24) ),
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p3(c21,X2)
    | ~ p2(f7(c17,c18),X1)
    | p3(f4(X1,X2),c23) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    p2(X1,X1),
    p2_6 ).

cnf(c_0_29,negated_conjecture,
    ( ~ p16(c17,c20,f9(c19,c18),X1,X2)
    | p3(c21,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p15(X1,c19)
    | p16(c17,c20,f9(c19,X1),f14(X1),c25) ),
    c_0_25 ).

cnf(c_0_31,negated_conjecture,
    p15(c18,c19),
    p15_7 ).

cnf(c_0_32,negated_conjecture,
    ~ p3(c23,c24),
    inference(fof_simplification,[status(thm)],[not_p3_8]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ p3(f4(f7(c17,X2),f14(X2)),X1)
    | ~ p15(X2,c19)
    | p3(X1,c24) ),
    inference(spm,[status(thm)],[c_0_12,c_0_26]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p3(c21,X1)
    | p3(f4(f7(c17,c18),X1),c23) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,negated_conjecture,
    p3(c21,f14(c18)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).

cnf(c_0_36,negated_conjecture,
    ~ p3(c23,c24),
    c_0_32 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN627-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.10/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 11:08:35 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40  Running first-order theorem proving
% 0.15/0.40  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.15/0.43  % Version: 3.5.1
% 0.15/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  % Starting sh5l with 300s (1) cores
% 0.15/0.43  % new_bool_3 with pid 939411 completed with status 0
% 0.15/0.43  % Result found by new_bool_3
% 0.15/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  % Search class: FGUNM-FFMS32-MFFFFFNN
% 0.15/0.43  % partial match(1): FGUNM-FFMS22-MFFFFFNN
% 0.15/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43  % SubtermCWHack with pid 939417 completed with status 0
% 0.15/0.43  % Result found by SubtermCWHack
% 0.15/0.43  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  % Search class: FGUNM-FFMS32-MFFFFFNN
% 0.15/0.43  % partial match(1): FGUNM-FFMS22-MFFFFFNN
% 0.15/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43  % Preprocessing time       : 0.001 s
% 0.15/0.43  
% 0.15/0.43  % Proof found!
% 0.15/0.43  % SZS status Unsatisfiable
% 0.15/0.43  % SZS output start CNFRefutation
% See solution above
% 0.15/0.43  % Parsed axioms                        : 36
% 0.15/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.43  % Initial clauses                      : 36
% 0.15/0.43  % Removed in clause preprocessing      : 0
% 0.15/0.43  % Initial clauses in saturation        : 36
% 0.15/0.43  % Processed clauses                    : 286
% 0.15/0.43  % ...of these trivial                  : 1
% 0.15/0.43  % ...subsumed                          : 135
% 0.15/0.43  % ...remaining for further processing  : 150
% 0.15/0.43  % Other redundant clauses eliminated   : 0
% 0.15/0.43  % Clauses deleted for lack of memory   : 0
% 0.15/0.43  % Backward-subsumed                    : 0
% 0.15/0.43  % Backward-rewritten                   : 0
% 0.15/0.43  % Generated clauses                    : 665
% 0.15/0.43  % ...of the previous two non-redundant : 589
% 0.15/0.43  % ...aggressively subsumed             : 0
% 0.15/0.43  % Contextual simplify-reflections      : 0
% 0.15/0.43  % Paramodulations                      : 665
% 0.15/0.43  % Factorizations                       : 0
% 0.15/0.43  % NegExts                              : 0
% 0.15/0.43  % Equation resolutions                 : 0
% 0.15/0.43  % Disequality decompositions           : 0
% 0.15/0.43  % Total rewrite steps                  : 169
% 0.15/0.43  % ...of those cached                   : 142
% 0.15/0.43  % Propositional unsat checks           : 0
% 0.15/0.43  %    Propositional check models        : 0
% 0.15/0.43  %    Propositional check unsatisfiable : 0
% 0.15/0.43  %    Propositional clauses             : 0
% 0.15/0.43  %    Propositional clauses after purity: 0
% 0.15/0.43  %    Propositional unsat core size     : 0
% 0.15/0.43  %    Propositional preprocessing time  : 0.000
% 0.15/0.43  %    Propositional encoding time       : 0.000
% 0.15/0.43  %    Propositional solver time         : 0.000
% 0.15/0.43  %    Success case prop preproc time    : 0.000
% 0.15/0.43  %    Success case prop encoding time   : 0.000
% 0.15/0.43  %    Success case prop solver time     : 0.000
% 0.15/0.43  % Current number of processed clauses  : 150
% 0.15/0.43  %    Positive orientable unit clauses  : 18
% 0.15/0.43  %    Positive unorientable unit clauses: 0
% 0.15/0.43  %    Negative unit clauses             : 1
% 0.15/0.43  %    Non-unit-clauses                  : 131
% 0.15/0.43  % Current number of unprocessed clauses: 326
% 0.15/0.43  % ...number of literals in the above   : 1105
% 0.15/0.43  % Current number of archived formulas  : 0
% 0.15/0.43  % Current number of archived clauses   : 0
% 0.15/0.43  % Clause-clause subsumption calls (NU) : 2659
% 0.15/0.43  % Rec. Clause-clause subsumption calls : 2539
% 0.15/0.43  % Non-unit clause-clause subsumptions  : 135
% 0.15/0.43  % Unit Clause-clause subsumption calls : 4
% 0.15/0.43  % Rewrite failures with RHS unbound    : 0
% 0.15/0.43  % BW rewrite match attempts            : 0
% 0.15/0.43  % BW rewrite match successes           : 0
% 0.15/0.43  % Condensation attempts                : 0
% 0.15/0.43  % Condensation successes               : 0
% 0.15/0.43  % Termbank termtop insertions          : 9669
% 0.15/0.43  % Search garbage collected termcells   : 141
% 0.15/0.43  
% 0.15/0.43  % -------------------------------------------------
% 0.15/0.43  % User time                : 0.010 s
% 0.15/0.43  % System time              : 0.002 s
% 0.15/0.43  % Total time               : 0.012 s
% 0.15/0.43  % Maximum resident set size: 3676 pages
% 0.15/0.43  
% 0.15/0.43  % -------------------------------------------------
% 0.15/0.43  % User time                : 0.011 s
% 0.15/0.43  % System time              : 0.007 s
% 0.15/0.43  % Total time               : 0.018 s
% 0.15/0.43  % Maximum resident set size: 4608 pages
% 0.15/0.43  % E exiting
%------------------------------------------------------------------------------