↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL446-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n018.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 01:12:48 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.44s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (   9 unt;   0 nHn;  10 RR)
%            Number of literals    :   25 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   47 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms_OMP_0,axiom,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

cnf(cls_PropLog_Othms_OS_0,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OS_0) ).

cnf(cls_PropLog_Othms_OK_0,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OK_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_4,plain,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OMP_0]) ).

cnf(c_0_5,plain,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    c_0_4 ).

cnf(c_0_6,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    cls_PropLog_Othms_OS_0 ).

cnf(c_0_7,plain,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X4,X3),X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
    | c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,plain,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X5,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X5,X2,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
    | c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_9,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),
    cls_PropLog_Othms_OK_0 ).

cnf(c_0_10,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_11,plain,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
    | c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    c_0_10 ).

cnf(c_0_13,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
    inference(spm,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL446-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n018.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 00:34:43 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42  Running first-order theorem proving
% 0.15/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.15/0.44  % Version: 3.5.1
% 0.15/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44  % Starting sh5l with 300s (1) cores
% 0.15/0.44  % new_bool_3 with pid 587087 completed with status 0
% 0.15/0.44  % Result found by new_bool_3
% 0.15/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44  % Search class: FHUNS-FFSF32-MFFFFFNN
% 0.15/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44  % SubtermCWHack with pid 587093 completed with status 0
% 0.15/0.44  % Result found by SubtermCWHack
% 0.15/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44  % Search class: FHUNS-FFSF32-MFFFFFNN
% 0.15/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44  % Preprocessing time       : 0.001 s
% 0.15/0.44  
% 0.15/0.44  % Proof found!
% 0.15/0.44  % SZS status Unsatisfiable
% 0.15/0.44  % SZS output start CNFRefutation
% See solution above
% 0.15/0.44  % Parsed axioms                        : 4
% 0.15/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.44  % Initial clauses                      : 4
% 0.15/0.44  % Removed in clause preprocessing      : 0
% 0.15/0.44  % Initial clauses in saturation        : 4
% 0.15/0.44  % Processed clauses                    : 10
% 0.15/0.44  % ...of these trivial                  : 0
% 0.15/0.44  % ...subsumed                          : 0
% 0.15/0.44  % ...remaining for further processing  : 10
% 0.15/0.44  % Other redundant clauses eliminated   : 0
% 0.15/0.44  % Clauses deleted for lack of memory   : 0
% 0.15/0.44  % Backward-subsumed                    : 0
% 0.15/0.44  % Backward-rewritten                   : 2
% 0.15/0.44  % Generated clauses                    : 15
% 0.15/0.44  % ...of the previous two non-redundant : 12
% 0.15/0.44  % ...aggressively subsumed             : 0
% 0.15/0.44  % Contextual simplify-reflections      : 0
% 0.15/0.44  % Paramodulations                      : 15
% 0.15/0.44  % Factorizations                       : 0
% 0.15/0.44  % NegExts                              : 0
% 0.15/0.44  % Equation resolutions                 : 0
% 0.15/0.44  % Disequality decompositions           : 0
% 0.15/0.44  % Total rewrite steps                  : 2
% 0.15/0.44  % ...of those cached                   : 0
% 0.15/0.44  % Propositional unsat checks           : 0
% 0.15/0.44  %    Propositional check models        : 0
% 0.15/0.44  %    Propositional check unsatisfiable : 0
% 0.15/0.44  %    Propositional clauses             : 0
% 0.15/0.44  %    Propositional clauses after purity: 0
% 0.15/0.44  %    Propositional unsat core size     : 0
% 0.15/0.44  %    Propositional preprocessing time  : 0.000
% 0.15/0.44  %    Propositional encoding time       : 0.000
% 0.15/0.44  %    Propositional solver time         : 0.000
% 0.15/0.44  %    Success case prop preproc time    : 0.000
% 0.15/0.44  %    Success case prop encoding time   : 0.000
% 0.15/0.44  %    Success case prop solver time     : 0.000
% 0.15/0.44  % Current number of processed clauses  : 8
% 0.15/0.44  %    Positive orientable unit clauses  : 3
% 0.15/0.44  %    Positive unorientable unit clauses: 0
% 0.15/0.44  %    Negative unit clauses             : 1
% 0.15/0.44  %    Non-unit-clauses                  : 4
% 0.15/0.44  % Current number of unprocessed clauses: 6
% 0.15/0.44  % ...number of literals in the above   : 13
% 0.15/0.44  % Current number of archived formulas  : 0
% 0.15/0.44  % Current number of archived clauses   : 2
% 0.15/0.44  % Clause-clause subsumption calls (NU) : 8
% 0.15/0.44  % Rec. Clause-clause subsumption calls : 8
% 0.15/0.44  % Non-unit clause-clause subsumptions  : 0
% 0.15/0.44  % Unit Clause-clause subsumption calls : 4
% 0.15/0.44  % Rewrite failures with RHS unbound    : 0
% 0.15/0.44  % BW rewrite match attempts            : 11
% 0.15/0.44  % BW rewrite match successes           : 2
% 0.15/0.44  % Condensation attempts                : 0
% 0.15/0.44  % Condensation successes               : 0
% 0.15/0.44  % Termbank termtop insertions          : 448
% 0.15/0.44  % Search garbage collected termcells   : 8
% 0.15/0.44  
% 0.15/0.44  % -------------------------------------------------
% 0.15/0.44  % User time                : 0.001 s
% 0.15/0.44  % System time              : 0.003 s
% 0.15/0.44  % Total time               : 0.004 s
% 0.15/0.44  % Maximum resident set size: 3584 pages
% 0.15/0.44  
% 0.15/0.44  % -------------------------------------------------
% 0.15/0.44  % User time                : 0.003 s
% 0.15/0.44  % System time              : 0.007 s
% 0.15/0.44  % Total time               : 0.010 s
% 0.15/0.44  % Maximum resident set size: 4608 pages
% 0.15/0.44  % E exiting
%------------------------------------------------------------------------------