↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV840-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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:00:03 PM UTC 2026

% Result   : Unsatisfiable 0.14s 10.50s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (  10 unt;   0 nHn;  13 RR)
%            Number of literals    :   27 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   9 con; 0-3 aty)
%            Number of variables   :   32 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_cut_0,axiom,
    ( ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_cut_0) ).

cnf(cls_asm_0,axiom,
    ( ~ c_lessequals(X2,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_asm_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(v_G,c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_subset__insertI_0,axiom,
    c_lessequals(X1,c_Set_Oinsert(X2,X1,X3),tc_fun(X3,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_subset__insertI_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q),v_G,tc_Hoare__Mirabelle_Otriple(t_a)),c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(c_0_5,plain,
    ( ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_cut_0]) ).

cnf(c_0_6,plain,
    ( ~ c_lessequals(X2,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_asm_0]) ).

cnf(c_0_7,plain,
    ( ~ c_Hoare__Mirabelle_Ohoare__derivs(X4,X2,X3)
    | ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,X4,X3)
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
    c_0_5 ).

cnf(c_0_8,negated_conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(v_G,c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
    cls_conjecture_0 ).

cnf(c_0_9,plain,
    ( ~ c_lessequals(X2,X1,tc_fun(tc_Hoare__Mirabelle_Otriple(X3),tc_bool))
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,X2,X3) ),
    c_0_6 ).

cnf(c_0_10,axiom,
    c_lessequals(X1,c_Set_Oinsert(X2,X1,X3),tc_fun(X3,tc_bool)),
    cls_subset__insertI_0 ).

cnf(c_0_11,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q),v_G,tc_Hoare__Mirabelle_Otriple(t_a)),c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ c_Hoare__Mirabelle_Ohoare__derivs(X1,v_G,t_a)
    | c_Hoare__Mirabelle_Ohoare__derivs(X1,c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,plain,
    c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(X1,X2,tc_Hoare__Mirabelle_Otriple(X3)),X2,X3),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ~ c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Com_Ocom_OBODY,v_pn)),v_Q),v_G,tc_Hoare__Mirabelle_Otriple(t_a)),c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
    c_0_11 ).

cnf(c_0_15,negated_conjecture,
    c_Hoare__Mirabelle_Ohoare__derivs(c_Set_Oinsert(X1,v_G,tc_Hoare__Mirabelle_Otriple(t_a)),c_Set_Oinsert(hAPP(hAPP(hAPP(c_Hoare__Mirabelle_Otriple_Otriple(t_a),v_P),hAPP(c_Option_Othe(tc_Com_Ocom),hAPP(c_Com_Obody,v_pn))),v_Q),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_bool)),tc_Hoare__Mirabelle_Otriple(t_a)),t_a),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV840-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/10.38  % Computer : n016.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.39  % CPULimit : 300
% 0.10/10.39  % WCLimit  : 300
% 0.10/10.39  % DateTime : Mon Sep 21 09:33:20 UTC 2026
% 0.10/10.39  % CPUTime  : 
% 0.10/10.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/10.43  Running first-order theorem proving
% 0.14/10.43  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.14/10.50  % Version: 3.5.1
% 0.14/10.50  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/10.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.50  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/10.50  % Starting new_bool_3 with 600s (2) cores
% 0.14/10.50  % Starting new_bool_1 with 300s (1) cores
% 0.14/10.50  % Starting sh5l with 300s (1) cores
% 0.14/10.50  % new_bool_3 with pid 2124200 completed with status 0
% 0.14/10.50  % Result found by new_bool_3
% 0.14/10.50  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/10.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.50  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/10.50  % Starting new_bool_3 with 600s (2) cores
% 0.14/10.50  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/10.50  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/10.50  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.14/10.50  % Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 0.14/10.50  % Starting SubtermCWHack with 55s (1) cores
% 0.14/10.50  % Starting new_bool_3 with 61s (1) cores
% 0.14/10.50  % new_bool_3 with pid 2124205 completed with status 0
% 0.14/10.50  % Result found by new_bool_3
% 0.14/10.50  % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/10.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.50  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/10.50  % Starting new_bool_3 with 600s (2) cores
% 0.14/10.50  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/10.50  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/10.50  % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.14/10.50  % Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 0.14/10.50  % Starting SubtermCWHack with 55s (1) cores
% 0.14/10.50  % Starting new_bool_3 with 61s (1) cores
% 0.14/10.50  % Preprocessing time       : 0.005 s
% 0.14/10.50  % Presaturation interreduction done
% 0.14/10.50  
% 0.14/10.50  % Proof found!
% 0.14/10.50  % SZS status Unsatisfiable
% 0.14/10.50  % SZS output start CNFRefutation
% See solution above
% 0.14/10.50  % Parsed axioms                        : 469
% 0.14/10.50  % Removed by relevancy pruning/SinE    : 207
% 0.14/10.50  % Initial clauses                      : 262
% 0.14/10.50  % Removed in clause preprocessing      : 0
% 0.14/10.50  % Initial clauses in saturation        : 262
% 0.14/10.50  % Processed clauses                    : 388
% 0.14/10.50  % ...of these trivial                  : 8
% 0.14/10.50  % ...subsumed                          : 61
% 0.14/10.50  % ...remaining for further processing  : 319
% 0.14/10.50  % Other redundant clauses eliminated   : 1
% 0.14/10.50  % Clauses deleted for lack of memory   : 0
% 0.14/10.50  % Backward-subsumed                    : 1
% 0.14/10.50  % Backward-rewritten                   : 5
% 0.14/10.50  % Generated clauses                    : 124
% 0.14/10.50  % ...of the previous two non-redundant : 43
% 0.14/10.50  % ...aggressively subsumed             : 0
% 0.14/10.50  % Contextual simplify-reflections      : 0
% 0.14/10.50  % Paramodulations                      : 107
% 0.14/10.50  % Factorizations                       : 0
% 0.14/10.50  % NegExts                              : 0
% 0.14/10.50  % Equation resolutions                 : 17
% 0.14/10.50  % Disequality decompositions           : 0
% 0.14/10.50  % Total rewrite steps                  : 64
% 0.14/10.50  % ...of those cached                   : 24
% 0.14/10.50  % Propositional unsat checks           : 0
% 0.14/10.50  %    Propositional check models        : 0
% 0.14/10.50  %    Propositional check unsatisfiable : 0
% 0.14/10.50  %    Propositional clauses             : 0
% 0.14/10.50  %    Propositional clauses after purity: 0
% 0.14/10.50  %    Propositional unsat core size     : 0
% 0.14/10.50  %    Propositional preprocessing time  : 0.000
% 0.14/10.50  %    Propositional encoding time       : 0.000
% 0.14/10.50  %    Propositional solver time         : 0.000
% 0.14/10.50  %    Success case prop preproc time    : 0.000
% 0.14/10.50  %    Success case prop encoding time   : 0.000
% 0.14/10.50  %    Success case prop solver time     : 0.000
% 0.14/10.50  % Current number of processed clauses  : 117
% 0.14/10.50  %    Positive orientable unit clauses  : 29
% 0.14/10.50  %    Positive unorientable unit clauses: 0
% 0.14/10.50  %    Negative unit clauses             : 27
% 0.14/10.50  %    Non-unit-clauses                  : 61
% 0.14/10.50  % Current number of unprocessed clauses: 112
% 0.14/10.50  % ...number of literals in the above   : 238
% 0.14/10.50  % Current number of archived formulas  : 0
% 0.14/10.50  % Current number of archived clauses   : 202
% 0.14/10.50  % Clause-clause subsumption calls (NU) : 5850
% 0.14/10.50  % Rec. Clause-clause subsumption calls : 5577
% 0.14/10.50  % Non-unit clause-clause subsumptions  : 26
% 0.14/10.50  % Unit Clause-clause subsumption calls : 455
% 0.14/10.50  % Rewrite failures with RHS unbound    : 0
% 0.14/10.50  % BW rewrite match attempts            : 36
% 0.14/10.50  % BW rewrite match successes           : 23
% 0.14/10.50  % Condensation attempts                : 0
% 0.14/10.50  % Condensation successes               : 0
% 0.14/10.50  % Termbank termtop insertions          : 13072
% 0.14/10.50  % Search garbage collected termcells   : 1458
% 0.14/10.50  
% 0.14/10.50  % -------------------------------------------------
% 0.14/10.50  % User time                : 0.032 s
% 0.14/10.50  % System time              : 0.004 s
% 0.14/10.50  % Total time               : 0.036 s
% 0.14/10.50  % Maximum resident set size: 4216 pages
% 0.14/10.50  
% 0.14/10.50  % -------------------------------------------------
% 0.14/10.50  % User time                : 0.071 s
% 0.14/10.50  % System time              : 0.012 s
% 0.14/10.50  % Total time               : 0.083 s
% 0.14/10.50  % Maximum resident set size: 4864 pages
% 0.14/10.50  % E exiting
%------------------------------------------------------------------------------