↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n014.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:16:35 PM UTC 2026

% Result   : Unsatisfiable 91.95s 13.95s
% Output   : CNFRefutation 91.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   35 (  20 unt;   3 nHn;  16 RR)
%            Number of literals    :   50 (  13 equ;  15 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   5 con; 0-5 aty)
%            Number of variables   :   90 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_set__takeWhileD_1,axiom,
    ( ~ c_in(X2,c_List_Oset(c_List_OtakeWhile(X1,X3,X4),X4),X4)
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_set__takeWhileD_1) ).

cnf(cls_in__listsp__conv__set_2,axiom,
    ( ~ hBOOL(hAPP(X1,c_List_Osko__List__Xin__listsp__conv__set__1__1(X1,X2,X3)))
    | c_List_Olistsp(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_in__listsp__conv__set_2) ).

cnf(cls_in__listsp__conv__set_1,axiom,
    ( c_in(c_List_Osko__List__Xin__listsp__conv__set__1__1(X1,X2,X3),c_List_Oset(X2,X3),X3)
    | c_List_Olistsp(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_in__listsp__conv__set_1) ).

cnf(cls_takeWhile_Osimps_I2_J_0,axiom,
    ( ~ hBOOL(hAPP(X1,X2))
    | c_List_OtakeWhile(X1,c_List_Olist_OCons(X2,X3,X4),X4) = c_List_Olist_OCons(X2,c_List_OtakeWhile(X1,X3,X4),X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_takeWhile_Osimps_I2_J_0) ).

cnf(cls_App_I4_J_0,axiom,
    hBOOL(hAPP(c_InductTermi_OIT,v_ta____)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_App_I4_J_0) ).

cnf(cls_lifts__IT_0,axiom,
    ( ~ c_List_Olistsp(c_InductTermi_OIT,X1,tc_Lambda_OdB)
    | c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),X1,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_lifts__IT_0) ).

cnf(cls_takeWhile_Osimps_I1_J_0,axiom,
    c_List_OtakeWhile(X1,c_List_Olist_ONil(X2),X2) = c_List_Olist_ONil(X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_takeWhile_Osimps_I1_J_0) ).

cnf(cls_map__eq__Cons__conv_3,axiom,
    c_List_Omap(X1,c_List_Olist_OCons(X2,X3,X4),X4,X5) = c_List_Olist_OCons(hAPP(X1,X2),c_List_Omap(X1,X3,X4,X5),X5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_map__eq__Cons__conv_3) ).

cnf(cls_Nil__is__map__conv_1,axiom,
    c_List_Olist_ONil(X1) = c_List_Omap(X2,c_List_Olist_ONil(X3),X3,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nil__is__map__conv_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_COMBC__def_0,axiom,
    hAPP(c_COMBC(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_COMBC__def_0) ).

cnf(c_0_11,plain,
    ( ~ c_in(X2,c_List_Oset(c_List_OtakeWhile(X1,X3,X4),X4),X4)
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_set__takeWhileD_1]) ).

cnf(c_0_12,plain,
    ( ~ hBOOL(hAPP(X1,c_List_Osko__List__Xin__listsp__conv__set__1__1(X1,X2,X3)))
    | c_List_Olistsp(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_in__listsp__conv__set_2]) ).

cnf(c_0_13,plain,
    ( ~ c_in(X2,c_List_Oset(c_List_OtakeWhile(X1,X3,X4),X4),X4)
    | hBOOL(hAPP(X1,X2)) ),
    c_0_11 ).

cnf(c_0_14,axiom,
    ( c_in(c_List_Osko__List__Xin__listsp__conv__set__1__1(X1,X2,X3),c_List_Oset(X2,X3),X3)
    | c_List_Olistsp(X1,X2,X3) ),
    cls_in__listsp__conv__set_1 ).

cnf(c_0_15,plain,
    ( ~ hBOOL(hAPP(X1,X2))
    | c_List_OtakeWhile(X1,c_List_Olist_OCons(X2,X3,X4),X4) = c_List_Olist_OCons(X2,c_List_OtakeWhile(X1,X3,X4),X4) ),
    inference(fof_simplification,[status(thm)],[cls_takeWhile_Osimps_I2_J_0]) ).

cnf(c_0_16,plain,
    ( ~ hBOOL(hAPP(X1,c_List_Osko__List__Xin__listsp__conv__set__1__1(X1,X2,X3)))
    | c_List_Olistsp(X1,X2,X3) ),
    c_0_12 ).

cnf(c_0_17,plain,
    ( hBOOL(hAPP(X2,c_List_Osko__List__Xin__listsp__conv__set__1__1(X1,c_List_OtakeWhile(X2,X3,X4),X4)))
    | c_List_Olistsp(X1,c_List_OtakeWhile(X2,X3,X4),X4) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( ~ hBOOL(hAPP(X1,X2))
    | c_List_OtakeWhile(X1,c_List_Olist_OCons(X2,X3,X4),X4) = c_List_Olist_OCons(X2,c_List_OtakeWhile(X1,X3,X4),X4) ),
    c_0_15 ).

cnf(c_0_19,axiom,
    hBOOL(hAPP(c_InductTermi_OIT,v_ta____)),
    cls_App_I4_J_0 ).

cnf(c_0_20,plain,
    c_List_Olistsp(X1,c_List_OtakeWhile(X1,X2,X3),X3),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    c_List_OtakeWhile(c_InductTermi_OIT,c_List_Olist_OCons(v_ta____,X1,X2),X2) = c_List_Olist_OCons(v_ta____,c_List_OtakeWhile(c_InductTermi_OIT,X1,X2),X2),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( ~ c_List_Olistsp(c_InductTermi_OIT,X1,tc_Lambda_OdB)
    | c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),X1,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB) ),
    inference(fof_simplification,[status(thm)],[cls_lifts__IT_0]) ).

cnf(c_0_23,plain,
    c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(v_ta____,c_List_OtakeWhile(c_InductTermi_OIT,X1,X2),X2),X2),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,axiom,
    c_List_OtakeWhile(X1,c_List_Olist_ONil(X2),X2) = c_List_Olist_ONil(X2),
    cls_takeWhile_Osimps_I1_J_0 ).

cnf(c_0_25,plain,
    ( ~ c_List_Olistsp(c_InductTermi_OIT,X1,tc_Lambda_OdB)
    | c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),X1,tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB) ),
    c_0_22 ).

cnf(c_0_26,plain,
    c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(v_ta____,c_List_Olist_ONil(X1),X1),X1),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,axiom,
    c_List_Omap(X1,c_List_Olist_OCons(X2,X3,X4),X4,X5) = c_List_Olist_OCons(hAPP(X1,X2),c_List_Omap(X1,X3,X4,X5),X5),
    cls_map__eq__Cons__conv_3 ).

cnf(c_0_28,axiom,
    c_List_Olist_ONil(X1) = c_List_Omap(X2,c_List_Olist_ONil(X3),X3,X1),
    cls_Nil__is__map__conv_1 ).

cnf(c_0_29,negated_conjecture,
    ~ c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_30,plain,
    c_List_Olistsp(c_InductTermi_OIT,c_List_Omap(c_COMBC(c_Lambda_Olift,c_HOL_Ozero__class_Ozero(tc_nat),tc_Lambda_OdB,tc_nat,tc_Lambda_OdB),c_List_Olist_OCons(v_ta____,c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB,tc_Lambda_OdB),tc_Lambda_OdB),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,plain,
    c_List_Omap(X1,c_List_Olist_OCons(X2,c_List_Olist_ONil(X3),X3),X3,X4) = c_List_Olist_OCons(hAPP(X1,X2),c_List_Olist_ONil(X4),X4),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,axiom,
    hAPP(c_COMBC(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),X2),
    cls_COMBC__def_0 ).

cnf(c_0_33,negated_conjecture,
    ~ c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_OCons(hAPP(hAPP(c_Lambda_Olift,v_ta____),c_HOL_Ozero__class_Ozero(tc_nat)),c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB),tc_Lambda_OdB),
    c_0_29 ).

cnf(c_0_34,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL847-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n014.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.05/0.38  % CPULimit : 300
% 0.05/0.38  % WCLimit  : 300
% 0.05/0.38  % DateTime : Mon Sep 21 01:08:04 UTC 2026
% 0.05/0.38  % CPUTime  : 
% 0.05/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.42  Running first-order theorem proving
% 0.05/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
% 91.95/13.95  % Version: 3.5.1
% 91.95/13.95  % Preprocessing class: FSLMSMSMSSSNFFN.
% 91.95/13.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 91.95/13.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 91.95/13.95  % Starting new_bool_3 with 600s (2) cores
% 91.95/13.95  % Starting new_bool_1 with 300s (1) cores
% 91.95/13.95  % Starting sh5l with 300s (1) cores
% 91.95/13.95  % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 2830191 completed with status 0
% 91.95/13.95  % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 91.95/13.95  % Preprocessing class: FSLMSMSMSSSNFFN.
% 91.95/13.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 91.95/13.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 91.95/13.95  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 91.95/13.95  % No SInE strategy applied
% 91.95/13.95  % Search class: FGHSM-FSLM32-DFFFFFNN
% 91.95/13.95  % Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 91.95/13.95  % Starting SubtermCWHack with 109s (1) cores
% 91.95/13.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 91.95/13.95  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 90s (1) cores
% 91.95/13.95  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 90s (1) cores
% 91.95/13.95  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2830201 completed with status 0
% 91.95/13.95  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 91.95/13.95  % Preprocessing class: FSLMSMSMSSSNFFN.
% 91.95/13.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 91.95/13.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 91.95/13.95  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 91.95/13.95  % No SInE strategy applied
% 91.95/13.95  % Search class: FGHSM-FSLM32-DFFFFFNN
% 91.95/13.95  % Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 91.95/13.95  % Starting SubtermCWHack with 109s (1) cores
% 91.95/13.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 91.95/13.95  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 90s (1) cores
% 91.95/13.95  % Preprocessing time       : 0.009 s
% 91.95/13.95  % Presaturation interreduction done
% 91.95/13.95  
% 91.95/13.95  % Proof found!
% 91.95/13.95  % SZS status Unsatisfiable
% 91.95/13.95  % SZS output start CNFRefutation
% See solution above
% 91.95/13.95  % Parsed axioms                        : 641
% 91.95/13.95  % Removed by relevancy pruning/SinE    : 0
% 91.95/13.95  % Initial clauses                      : 641
% 91.95/13.95  % Removed in clause preprocessing      : 2
% 91.95/13.95  % Initial clauses in saturation        : 639
% 91.95/13.95  % Processed clauses                    : 24327
% 91.95/13.95  % ...of these trivial                  : 1476
% 91.95/13.95  % ...subsumed                          : 17872
% 91.95/13.95  % ...remaining for further processing  : 4979
% 91.95/13.95  % Other redundant clauses eliminated   : 537
% 91.95/13.95  % Clauses deleted for lack of memory   : 0
% 91.95/13.95  % Backward-subsumed                    : 76
% 91.95/13.95  % Backward-rewritten                   : 79
% 91.95/13.95  % Generated clauses                    : 491572
% 91.95/13.95  % ...of the previous two non-redundant : 469081
% 91.95/13.95  % ...aggressively subsumed             : 0
% 91.95/13.95  % Contextual simplify-reflections      : 14
% 91.95/13.95  % Paramodulations                      : 490946
% 91.95/13.95  % Factorizations                       : 48
% 91.95/13.95  % NegExts                              : 0
% 91.95/13.95  % Equation resolutions                 : 578
% 91.95/13.95  % Disequality decompositions           : 0
% 91.95/13.95  % Total rewrite steps                  : 1278744
% 91.95/13.95  % ...of those cached                   : 1016817
% 91.95/13.95  % Propositional unsat checks           : 0
% 91.95/13.95  %    Propositional check models        : 0
% 91.95/13.95  %    Propositional check unsatisfiable : 0
% 91.95/13.95  %    Propositional clauses             : 0
% 91.95/13.95  %    Propositional clauses after purity: 0
% 91.95/13.95  %    Propositional unsat core size     : 0
% 91.95/13.95  %    Propositional preprocessing time  : 0.000
% 91.95/13.95  %    Propositional encoding time       : 0.000
% 91.95/13.95  %    Propositional solver time         : 0.000
% 91.95/13.95  %    Success case prop preproc time    : 0.000
% 91.95/13.95  %    Success case prop encoding time   : 0.000
% 91.95/13.95  %    Success case prop solver time     : 0.000
% 91.95/13.95  % Current number of processed clauses  : 4303
% 91.95/13.95  %    Positive orientable unit clauses  : 1964
% 91.95/13.95  %    Positive unorientable unit clauses: 40
% 91.95/13.95  %    Negative unit clauses             : 254
% 91.95/13.95  %    Non-unit-clauses                  : 2045
% 91.95/13.95  % Current number of unprocessed clauses: 443698
% 91.95/13.95  % ...number of literals in the above   : 601425
% 91.95/13.95  % Current number of archived formulas  : 0
% 91.95/13.95  % Current number of archived clauses   : 677
% 91.95/13.95  % Clause-clause subsumption calls (NU) : 686963
% 91.95/13.95  % Rec. Clause-clause subsumption calls : 533018
% 91.95/13.95  % Non-unit clause-clause subsumptions  : 6250
% 91.95/13.95  % Unit Clause-clause subsumption calls : 73456
% 91.95/13.95  % Rewrite failures with RHS unbound    : 141
% 91.95/13.95  % BW rewrite match attempts            : 196848
% 91.95/13.95  % BW rewrite match successes           : 220
% 91.95/13.95  % Condensation attempts                : 0
% 91.95/13.95  % Condensation successes               : 0
% 91.95/13.95  % Termbank termtop insertions          : 20322586
% 91.95/13.95  % Search garbage collected termcells   : 1058
% 91.95/13.95  
% 91.95/13.95  % -------------------------------------------------
% 91.95/13.95  % User time                : 12.530 s
% 91.95/13.95  % System time              : 0.574 s
% 91.95/13.95  % Total time               : 13.104 s
% 91.95/13.95  % Maximum resident set size: 4880 pages
% 91.95/13.95  
% 91.95/13.95  % -------------------------------------------------
% 91.95/13.95  % User time                : 50.521 s
% 91.95/13.95  % System time              : 2.085 s
% 91.95/13.95  % Total time               : 52.606 s
% 91.95/13.95  % Maximum resident set size: 5376 pages
% 91.95/13.95  % E exiting
%------------------------------------------------------------------------------