↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n012.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:36 PM UTC 2026

% Result   : Unsatisfiable 0.07s 0.34s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;  17 RR)
%            Number of literals    :   28 (  27 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  10 con; 0-4 aty)
%            Number of variables   :   34 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Tarski_OCL_Olub__upper_0,axiom,
    ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OCL_Olub__upper_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)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_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_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)) = true,
    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(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_x,v_S,t_a) = true,
    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)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0,axiom,
    ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0) ).

cnf(cls_Tarski_Or_A_61_61_Aorder_Acl_0,axiom,
    v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Or_A_61_61_Aorder_Acl_0) ).

cnf(c_0_12,axiom,
    ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true) = true,
    cls_Tarski_OCL_Olub__upper_0 ).

cnf(c_0_13,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)) = true,
    cls_Tarski_Odual_Acl_A_58_APartialOrder_0 ).

cnf(c_0_14,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_15,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_16,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)) = true,
    cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0 ).

cnf(c_0_17,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_18,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_19,plain,
    ifeq(c_lessequals(X1,v_A,tc_set(t_a)),true,ifeq(c_in(X2,X1,t_a),true,c_in(c_Pair(X2,c_Tarski_Oglb(X1,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true) = true,
    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_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    c_in(v_x,v_S,t_a) = true,
    cls_conjecture_1 ).

cnf(c_0_21,negated_conjecture,
    c_lessequals(v_S,v_A,tc_set(t_a)) = true,
    cls_conjecture_0 ).

cnf(c_0_22,negated_conjecture,
    c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) != true,
    inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).

cnf(c_0_23,axiom,
    ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true) = true,
    cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0 ).

cnf(c_0_24,negated_conjecture,
    c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_18]),c_0_18]) ).

cnf(c_0_25,axiom,
    v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
    cls_Tarski_Or_A_61_61_Aorder_Acl_0 ).

cnf(c_0_26,negated_conjecture,
    c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) != true,
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_18]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LAT268-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Sun Sep 20 23:23:53 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.03/0.30  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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.07/0.34  % Version: 3.5.1
% 0.07/0.34  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.34  % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34  % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34  % Starting sh5l with 300s (1) cores
% 0.07/0.34  % new_bool_3 with pid 1069529 completed with status 0
% 0.07/0.34  % Result found by new_bool_3
% 0.07/0.34  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.34  % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34  % Search class: FUUPM-FFSM32-DFFFFFNN
% 0.07/0.34  % partial match(1): FUUPM-FFMM32-DFFFFFNN
% 0.07/0.34  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34  % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34  % SubtermCWHack with pid 1069534 completed with status 0
% 0.07/0.34  % Result found by SubtermCWHack
% 0.07/0.34  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.34  % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34  % Search class: FUUPM-FFSM32-DFFFFFNN
% 0.07/0.34  % partial match(1): FUUPM-FFMM32-DFFFFFNN
% 0.07/0.34  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34  % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34  % Preprocessing time       : 0.001 s
% 0.07/0.34  
% 0.07/0.34  % Proof found!
% 0.07/0.34  % SZS status Unsatisfiable
% 0.07/0.34  % SZS output start CNFRefutation
% See solution above
% 0.07/0.34  % Parsed axioms                        : 12
% 0.07/0.34  % Removed by relevancy pruning/SinE    : 0
% 0.07/0.34  % Initial clauses                      : 12
% 0.07/0.34  % Removed in clause preprocessing      : 0
% 0.07/0.34  % Initial clauses in saturation        : 12
% 0.07/0.34  % Processed clauses                    : 15
% 0.07/0.34  % ...of these trivial                  : 0
% 0.07/0.34  % ...subsumed                          : 0
% 0.07/0.34  % ...remaining for further processing  : 15
% 0.07/0.34  % Other redundant clauses eliminated   : 0
% 0.07/0.34  % Clauses deleted for lack of memory   : 0
% 0.07/0.34  % Backward-subsumed                    : 0
% 0.07/0.34  % Backward-rewritten                   : 0
% 0.07/0.34  % Generated clauses                    : 17
% 0.07/0.34  % ...of the previous two non-redundant : 14
% 0.07/0.34  % ...aggressively subsumed             : 0
% 0.07/0.34  % Contextual simplify-reflections      : 0
% 0.07/0.34  % Paramodulations                      : 17
% 0.07/0.34  % Factorizations                       : 0
% 0.07/0.34  % NegExts                              : 0
% 0.07/0.34  % Equation resolutions                 : 0
% 0.07/0.34  % Disequality decompositions           : 0
% 0.07/0.34  % Total rewrite steps                  : 26
% 0.07/0.34  % ...of those cached                   : 9
% 0.07/0.34  % Propositional unsat checks           : 0
% 0.07/0.34  %    Propositional check models        : 0
% 0.07/0.34  %    Propositional check unsatisfiable : 0
% 0.07/0.34  %    Propositional clauses             : 0
% 0.07/0.34  %    Propositional clauses after purity: 0
% 0.07/0.34  %    Propositional unsat core size     : 0
% 0.07/0.34  %    Propositional preprocessing time  : 0.000
% 0.07/0.34  %    Propositional encoding time       : 0.000
% 0.07/0.34  %    Propositional solver time         : 0.000
% 0.07/0.34  %    Success case prop preproc time    : 0.000
% 0.07/0.34  %    Success case prop encoding time   : 0.000
% 0.07/0.34  %    Success case prop solver time     : 0.000
% 0.07/0.34  % Current number of processed clauses  : 15
% 0.07/0.34  %    Positive orientable unit clauses  : 14
% 0.07/0.34  %    Positive unorientable unit clauses: 0
% 0.07/0.34  %    Negative unit clauses             : 1
% 0.07/0.34  %    Non-unit-clauses                  : 0
% 0.07/0.34  % Current number of unprocessed clauses: 9
% 0.07/0.34  % ...number of literals in the above   : 9
% 0.07/0.34  % Current number of archived formulas  : 0
% 0.07/0.34  % Current number of archived clauses   : 0
% 0.07/0.34  % Clause-clause subsumption calls (NU) : 0
% 0.07/0.34  % Rec. Clause-clause subsumption calls : 0
% 0.07/0.34  % Non-unit clause-clause subsumptions  : 0
% 0.07/0.34  % Unit Clause-clause subsumption calls : 0
% 0.07/0.34  % Rewrite failures with RHS unbound    : 0
% 0.07/0.34  % BW rewrite match attempts            : 1
% 0.07/0.34  % BW rewrite match successes           : 0
% 0.07/0.34  % Condensation attempts                : 0
% 0.07/0.34  % Condensation successes               : 0
% 0.07/0.34  % Termbank termtop insertions          : 1169
% 0.07/0.34  % Search garbage collected termcells   : 2
% 0.07/0.34  
% 0.07/0.34  % -------------------------------------------------
% 0.07/0.34  % User time                : 0.004 s
% 0.07/0.34  % System time              : 0.001 s
% 0.07/0.34  % Total time               : 0.005 s
% 0.07/0.34  % Maximum resident set size: 3648 pages
% 0.07/0.34  
% 0.07/0.34  % -------------------------------------------------
% 0.07/0.34  % User time                : 0.005 s
% 0.07/0.34  % System time              : 0.006 s
% 0.07/0.34  % Total time               : 0.011 s
% 0.07/0.34  % Maximum resident set size: 4864 pages
% 0.07/0.34  % E exiting
%------------------------------------------------------------------------------