↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN098-1.002 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n004.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:23:07 PM UTC 2026

% Result   : Unsatisfiable 0.26s 0.57s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   48 (   9 unt;  15 nHn;  48 RR)
%            Number of literals    :  108 (   0 equ;  50 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :   14 (  13 usr;  14 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(u_16_t3_3,axiom,
    ( ~ u_16
    | q_2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_16_t3_3) ).

cnf(u_14_t3_1,axiom,
    ( ~ u_14
    | p_2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_14_t3_1) ).

cnf(u_s3_goal_1,negated_conjecture,
    ( ~ q_0
    | ~ p_0
    | u_1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_s3_goal_1) ).

cnf(u_1_s3_goal_1,axiom,
    ~ u_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_1_s3_goal_1) ).

cnf(u_s3_type12_1,axiom,
    ( ~ q_2
    | ~ p_1
    | q_0
    | u_6 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_s3_type12_1) ).

cnf(u_t3_3,axiom,
    ( q_2
    | u_16 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_t3_3) ).

cnf(u_6_s3_type12_1,axiom,
    ( ~ u_6
    | q_0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_6_s3_type12_1) ).

cnf(u_s3_type11_1,axiom,
    ( ~ p_2
    | ~ p_1
    | p_0
    | u_2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_s3_type11_1) ).

cnf(u_t3_1,axiom,
    ( p_2
    | u_14 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_t3_1) ).

cnf(u_2_s3_type11_1,axiom,
    ( ~ u_2
    | p_0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_2_s3_type11_1) ).

cnf(u_15_t3_2,axiom,
    ( ~ u_15
    | p_3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_15_t3_2) ).

cnf(u_s3_type11_3,axiom,
    ( ~ p_3
    | ~ p_2
    | p_1
    | u_4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_s3_type11_3) ).

cnf(u_t3_2,axiom,
    ( p_3
    | u_15 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_t3_2) ).

cnf(u_4_s3_type11_3,axiom,
    ( ~ u_4
    | p_1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_4_s3_type11_3) ).

cnf(c_0_14,plain,
    ( ~ u_16
    | q_2 ),
    inference(fof_simplification,[status(thm)],[u_16_t3_3]) ).

cnf(c_0_15,plain,
    ( ~ u_14
    | p_2 ),
    inference(fof_simplification,[status(thm)],[u_14_t3_1]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ q_0
    | ~ p_0
    | u_1 ),
    inference(fof_simplification,[status(thm)],[u_s3_goal_1]) ).

cnf(c_0_17,plain,
    ~ u_1,
    inference(fof_simplification,[status(thm)],[u_1_s3_goal_1]) ).

cnf(c_0_18,plain,
    ( ~ q_2
    | ~ p_1
    | q_0
    | u_6 ),
    inference(fof_simplification,[status(thm)],[u_s3_type12_1]) ).

cnf(c_0_19,plain,
    ( ~ u_16
    | q_2 ),
    c_0_14 ).

cnf(c_0_20,axiom,
    ( q_2
    | u_16 ),
    u_t3_3 ).

cnf(c_0_21,plain,
    ( ~ u_6
    | q_0 ),
    inference(fof_simplification,[status(thm)],[u_6_s3_type12_1]) ).

cnf(c_0_22,plain,
    ( ~ p_2
    | ~ p_1
    | p_0
    | u_2 ),
    inference(fof_simplification,[status(thm)],[u_s3_type11_1]) ).

cnf(c_0_23,plain,
    ( ~ u_14
    | p_2 ),
    c_0_15 ).

cnf(c_0_24,axiom,
    ( p_2
    | u_14 ),
    u_t3_1 ).

cnf(c_0_25,plain,
    ( ~ u_2
    | p_0 ),
    inference(fof_simplification,[status(thm)],[u_2_s3_type11_1]) ).

cnf(c_0_26,plain,
    ( ~ u_15
    | p_3 ),
    inference(fof_simplification,[status(thm)],[u_15_t3_2]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ q_0
    | ~ p_0
    | u_1 ),
    c_0_16 ).

cnf(c_0_28,plain,
    ~ u_1,
    c_0_17 ).

cnf(c_0_29,plain,
    ( ~ q_2
    | ~ p_1
    | q_0
    | u_6 ),
    c_0_18 ).

cnf(c_0_30,plain,
    q_2,
    inference(csr,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_31,plain,
    ( ~ u_6
    | q_0 ),
    c_0_21 ).

cnf(c_0_32,plain,
    ( ~ p_2
    | ~ p_1
    | p_0
    | u_2 ),
    c_0_22 ).

cnf(c_0_33,plain,
    p_2,
    inference(csr,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_34,plain,
    ( ~ u_2
    | p_0 ),
    c_0_25 ).

cnf(c_0_35,plain,
    ( ~ p_3
    | ~ p_2
    | p_1
    | u_4 ),
    inference(fof_simplification,[status(thm)],[u_s3_type11_3]) ).

cnf(c_0_36,plain,
    ( ~ u_15
    | p_3 ),
    c_0_26 ).

cnf(c_0_37,axiom,
    ( p_3
    | u_15 ),
    u_t3_2 ).

cnf(c_0_38,negated_conjecture,
    ( ~ p_0
    | ~ q_0 ),
    inference(sr,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_39,plain,
    ( ~ p_1
    | q_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),c_0_31]) ).

cnf(c_0_40,plain,
    ( ~ p_1
    | p_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),c_0_34]) ).

cnf(c_0_41,plain,
    ( ~ u_4
    | p_1 ),
    inference(fof_simplification,[status(thm)],[u_4_s3_type11_3]) ).

cnf(c_0_42,plain,
    ( ~ p_3
    | ~ p_2
    | p_1
    | u_4 ),
    c_0_35 ).

cnf(c_0_43,plain,
    p_3,
    inference(csr,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_44,negated_conjecture,
    ~ p_1,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_45,plain,
    ( ~ u_4
    | p_1 ),
    c_0_41 ).

cnf(c_0_46,plain,
    u_4,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_33]),c_0_43])]),c_0_44]) ).

cnf(c_0_47,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),c_0_44]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN098-1.002 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n004.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 10:43:19 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51  Running first-order theorem proving
% 0.26/0.51  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.26/0.57  % Version: 3.5.1
% 0.26/0.57  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.26/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.26/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.57  % Starting sh5l with 300s (1) cores
% 0.26/0.57  % sh5l with pid 2940661 completed with status 0
% 0.26/0.57  % Result found by sh5l
% 0.26/0.57  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.26/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.26/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.57  % Starting sh5l with 300s (1) cores
% 0.26/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.57  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.57  % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.26/0.57  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.57  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.57  % SubtermCWHack with pid 2940672 completed with status 0
% 0.26/0.57  % Result found by SubtermCWHack
% 0.26/0.57  % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.26/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.57  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.26/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.57  % Starting sh5l with 300s (1) cores
% 0.26/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.57  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.57  % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.26/0.57  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.57  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.57  % Preprocessing time       : 0.002 s
% 0.26/0.57  
% 0.26/0.57  % Proof found!
% 0.26/0.57  % SZS status Unsatisfiable
% 0.26/0.57  % SZS output start CNFRefutation
% See solution above
% 0.26/0.57  % Parsed axioms                        : 68
% 0.26/0.57  % Removed by relevancy pruning/SinE    : 34
% 0.26/0.57  % Initial clauses                      : 34
% 0.26/0.57  % Removed in clause preprocessing      : 0
% 0.26/0.57  % Initial clauses in saturation        : 34
% 0.26/0.57  % Processed clauses                    : 33
% 0.26/0.57  % ...of these trivial                  : 2
% 0.26/0.57  % ...subsumed                          : 0
% 0.26/0.57  % ...remaining for further processing  : 31
% 0.26/0.57  % Other redundant clauses eliminated   : 0
% 0.26/0.57  % Clauses deleted for lack of memory   : 0
% 0.26/0.57  % Backward-subsumed                    : 4
% 0.26/0.57  % Backward-rewritten                   : 9
% 0.26/0.57  % Generated clauses                    : 2
% 0.26/0.57  % ...of the previous two non-redundant : 2
% 0.26/0.57  % ...aggressively subsumed             : 0
% 0.26/0.57  % Contextual simplify-reflections      : 12
% 0.26/0.57  % Paramodulations                      : 2
% 0.26/0.57  % Factorizations                       : 0
% 0.26/0.57  % NegExts                              : 0
% 0.26/0.57  % Equation resolutions                 : 0
% 0.26/0.57  % Disequality decompositions           : 0
% 0.26/0.57  % Total rewrite steps                  : 19
% 0.26/0.57  % ...of those cached                   : 12
% 0.26/0.57  % Propositional unsat checks           : 0
% 0.26/0.57  %    Propositional check models        : 0
% 0.26/0.57  %    Propositional check unsatisfiable : 0
% 0.26/0.57  %    Propositional clauses             : 0
% 0.26/0.57  %    Propositional clauses after purity: 0
% 0.26/0.57  %    Propositional unsat core size     : 0
% 0.26/0.57  %    Propositional preprocessing time  : 0.000
% 0.26/0.57  %    Propositional encoding time       : 0.000
% 0.26/0.57  %    Propositional solver time         : 0.000
% 0.26/0.57  %    Success case prop preproc time    : 0.000
% 0.26/0.57  %    Success case prop encoding time   : 0.000
% 0.26/0.57  %    Success case prop solver time     : 0.000
% 0.26/0.57  % Current number of processed clauses  : 18
% 0.26/0.57  %    Positive orientable unit clauses  : 7
% 0.26/0.57  %    Positive unorientable unit clauses: 0
% 0.26/0.57  %    Negative unit clauses             : 3
% 0.26/0.57  %    Non-unit-clauses                  : 8
% 0.26/0.57  % Current number of unprocessed clauses: 3
% 0.26/0.57  % ...number of literals in the above   : 12
% 0.26/0.57  % Current number of archived formulas  : 0
% 0.26/0.57  % Current number of archived clauses   : 13
% 0.26/0.57  % Clause-clause subsumption calls (NU) : 55
% 0.26/0.57  % Rec. Clause-clause subsumption calls : 55
% 0.26/0.57  % Non-unit clause-clause subsumptions  : 12
% 0.26/0.57  % Unit Clause-clause subsumption calls : 13
% 0.26/0.57  % Rewrite failures with RHS unbound    : 0
% 0.26/0.57  % BW rewrite match attempts            : 7
% 0.26/0.57  % BW rewrite match successes           : 7
% 0.26/0.57  % Condensation attempts                : 0
% 0.26/0.57  % Condensation successes               : 0
% 0.26/0.57  % Termbank termtop insertions          : 1035
% 0.26/0.57  % Search garbage collected termcells   : 196
% 0.26/0.57  
% 0.26/0.57  % -------------------------------------------------
% 0.26/0.57  % User time                : 0.006 s
% 0.26/0.57  % System time              : 0.002 s
% 0.26/0.57  % Total time               : 0.008 s
% 0.26/0.57  % Maximum resident set size: 3676 pages
% 0.26/0.57  
% 0.26/0.57  % -------------------------------------------------
% 0.26/0.57  % User time                : 0.009 s
% 0.26/0.57  % System time              : 0.008 s
% 0.26/0.57  % Total time               : 0.017 s
% 0.26/0.57  % Maximum resident set size: 4608 pages
% 0.26/0.57  % E exiting
%------------------------------------------------------------------------------