↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LAT263-1 : 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 : n020.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:04:35 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Tarski_OCL_Olub__in__lattice_0,axiom,
    ( ~ c_lessequals(X3,c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),tc_set(X2))
    | ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
    | ~ c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
    | c_in(c_Tarski_Olub(X3,X1,X2),c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OCL_Olub__in__lattice_0) ).

cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom,
    c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) ).

cnf(cls_Tarski_Oglb__dual__lub_0,axiom,
    c_Tarski_Oglb(X1,X2,X3) = c_Tarski_Olub(X1,c_Tarski_Odual(X2,X3),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Oglb__dual__lub_0) ).

cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
    c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).

cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
    v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).

cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom,
    c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(v_S,v_A,tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_8,plain,
    ( ~ c_lessequals(X3,c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),tc_set(X2))
    | ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
    | ~ c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
    | c_in(c_Tarski_Olub(X3,X1,X2),c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),X2) ),
    inference(fof_simplification,[status(thm)],[cls_Tarski_OCL_Olub__in__lattice_0]) ).

cnf(c_0_9,plain,
    ( ~ c_lessequals(X3,c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),tc_set(X2))
    | ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
    | ~ c_in(X1,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit))
    | c_in(c_Tarski_Olub(X3,X1,X2),c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),X2) ),
    c_0_8 ).

cnf(c_0_10,axiom,
    c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0 ).

cnf(c_0_11,axiom,
    c_Tarski_Oglb(X1,X2,X3) = c_Tarski_Olub(X1,c_Tarski_Odual(X2,X3),X3),
    cls_Tarski_Oglb__dual__lub_0 ).

cnf(c_0_12,axiom,
    c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),
    cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0 ).

cnf(c_0_13,axiom,
    v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
    cls_Tarski_OA_A_61_61_Apset_Acl_0 ).

cnf(c_0_14,axiom,
    c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    cls_Tarski_Odual_Acl_A_58_APartialOrder_0 ).

cnf(c_0_15,negated_conjecture,
    ~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_16,plain,
    ( ~ c_lessequals(X1,v_A,tc_set(t_a))
    | c_in(c_Tarski_Oglb(X1,v_cl,t_a),v_A,t_a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_17,negated_conjecture,
    c_lessequals(v_S,v_A,tc_set(t_a)),
    cls_conjecture_0 ).

cnf(c_0_18,negated_conjecture,
    ~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
    c_0_15 ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LAT263-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45  % Computer : n020.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Sun Sep 20 23:24:47 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.52  Running first-order theorem proving
% 0.22/0.52  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
% 197.77/29.10  % Version: 3.5.1
% 197.77/29.10  % Preprocessing class: FMLMSMSMSSSNFFN.
% 197.77/29.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 197.77/29.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 197.77/29.10  % Starting new_bool_3 with 300s (1) cores
% 197.77/29.10  % Starting new_bool_1 with 300s (1) cores
% 197.77/29.10  % Starting sh5l with 300s (1) cores
% 197.77/29.10  % new_bool_1 with pid 1442729 completed with status 0
% 197.77/29.10  % Result found by new_bool_1
% 197.77/29.10  % Preprocessing class: FMLMSMSMSSSNFFN.
% 197.77/29.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 197.77/29.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 197.77/29.10  % Starting new_bool_3 with 300s (1) cores
% 197.77/29.10  % Starting new_bool_1 with 300s (1) cores
% 197.77/29.10  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 197.77/29.10  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 197.77/29.10  % Search class: FGHSM-FFMM32-MFFFFFNN
% 197.77/29.10  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 197.77/29.10  % Starting SubtermCWHack with 28s (1) cores
% 197.77/29.10  % SubtermCWHack with pid 1442732 completed with status 8
% 197.77/29.10  % Starting new_bool_1 with 31s (1) cores
% 197.77/29.10  % new_bool_1 with pid 1443291 completed with status 0
% 197.77/29.10  % Result found by new_bool_1
% 197.77/29.10  % Preprocessing class: FMLMSMSMSSSNFFN.
% 197.77/29.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 197.77/29.10  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 197.77/29.10  % Starting new_bool_3 with 300s (1) cores
% 197.77/29.10  % Starting new_bool_1 with 300s (1) cores
% 197.77/29.10  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 197.77/29.10  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 197.77/29.10  % Search class: FGHSM-FFMM32-MFFFFFNN
% 197.77/29.10  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 197.77/29.10  % Starting SubtermCWHack with 28s (1) cores
% 197.77/29.10  % SubtermCWHack with pid 1442732 completed with status 8
% 197.77/29.10  % Starting new_bool_1 with 31s (1) cores
% 197.77/29.10  % Preprocessing time       : 0.005 s
% 197.77/29.10  % Presaturation interreduction done
% 197.77/29.10  
% 197.77/29.10  % Proof found!
% 197.77/29.10  % SZS status Unsatisfiable
% 197.77/29.10  % SZS output start CNFRefutation
% See solution above
% 197.77/29.10  % Parsed axioms                        : 2748
% 197.77/29.10  % Removed by relevancy pruning/SinE    : 2680
% 197.77/29.10  % Initial clauses                      : 68
% 197.77/29.10  % Removed in clause preprocessing      : 0
% 197.77/29.10  % Initial clauses in saturation        : 68
% 197.77/29.10  % Processed clauses                    : 177
% 197.77/29.10  % ...of these trivial                  : 2
% 197.77/29.10  % ...subsumed                          : 18
% 197.77/29.10  % ...remaining for further processing  : 157
% 197.77/29.10  % Other redundant clauses eliminated   : 3
% 197.77/29.10  % Clauses deleted for lack of memory   : 0
% 197.77/29.10  % Backward-subsumed                    : 1
% 197.77/29.10  % Backward-rewritten                   : 2
% 197.77/29.10  % Generated clauses                    : 190
% 197.77/29.10  % ...of the previous two non-redundant : 123
% 197.77/29.10  % ...aggressively subsumed             : 0
% 197.77/29.10  % Contextual simplify-reflections      : 0
% 197.77/29.10  % Paramodulations                      : 184
% 197.77/29.10  % Factorizations                       : 0
% 197.77/29.10  % NegExts                              : 0
% 197.77/29.10  % Equation resolutions                 : 6
% 197.77/29.10  % Disequality decompositions           : 0
% 197.77/29.10  % Total rewrite steps                  : 117
% 197.77/29.10  % ...of those cached                   : 62
% 197.77/29.10  % Propositional unsat checks           : 0
% 197.77/29.10  %    Propositional check models        : 0
% 197.77/29.10  %    Propositional check unsatisfiable : 0
% 197.77/29.10  %    Propositional clauses             : 0
% 197.77/29.10  %    Propositional clauses after purity: 0
% 197.77/29.10  %    Propositional unsat core size     : 0
% 197.77/29.10  %    Propositional preprocessing time  : 0.000
% 197.77/29.10  %    Propositional encoding time       : 0.000
% 197.77/29.10  %    Propositional solver time         : 0.000
% 197.77/29.10  %    Success case prop preproc time    : 0.000
% 197.77/29.10  %    Success case prop encoding time   : 0.000
% 197.77/29.10  %    Success case prop solver time     : 0.000
% 197.77/29.10  % Current number of processed clauses  : 89
% 197.77/29.10  %    Positive orientable unit clauses  : 35
% 197.77/29.10  %    Positive unorientable unit clauses: 0
% 197.77/29.10  %    Negative unit clauses             : 8
% 197.77/29.10  %    Non-unit-clauses                  : 46
% 197.77/29.10  % Current number of unprocessed clauses: 79
% 197.77/29.10  % ...number of literals in the above   : 115
% 197.77/29.10  % Current number of archived formulas  : 0
% 197.77/29.10  % Current number of archived clauses   : 68
% 197.77/29.10  % Clause-clause subsumption calls (NU) : 393
% 197.77/29.10  % Rec. Clause-clause subsumption calls : 362
% 197.77/29.10  % Non-unit clause-clause subsumptions  : 4
% 197.77/29.10  % Unit Clause-clause subsumption calls : 57
% 197.77/29.10  % Rewrite failures with RHS unbound    : 0
% 197.77/29.10  % BW rewrite match attempts            : 49
% 197.77/29.10  % BW rewrite match successes           : 2
% 197.77/29.10  % Condensation attempts                : 0
% 197.77/29.10  % Condensation successes               : 0
% 197.77/29.10  % Termbank termtop insertions          : 27340
% 197.77/29.10  % Search garbage collected termcells   : 7933
% 197.77/29.10  
% 197.77/29.10  % -------------------------------------------------
% 197.77/29.10  % User time                : 27.121 s
% 197.77/29.10  % System time              : 1.020 s
% 197.77/29.10  % Total time               : 28.141 s
% 197.77/29.10  % Maximum resident set size: 6120 pages
% 197.77/29.10  
% 197.77/29.10  % -------------------------------------------------
% 197.77/29.10  % User time                : 27.214 s
% 197.77/29.10  % System time              : 1.030 s
% 197.77/29.10  % Total time               : 28.244 s
% 197.77/29.10  % Maximum resident set size: 6656 pages
% 197.77/29.10  % E exiting
%------------------------------------------------------------------------------