TSTP Solution File: NUM042-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : NUM042-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:47:33 EDT 2024

% Result   : Unsatisfiable 0.17s 0.53s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   35 (  17 unt;   3 nHn;  22 RR)
%            Number of literals    :   56 (   8 equ;  22 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   3 con; 0-3 aty)
%            Number of variables   :   57 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',subclass_members) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',not_subclass_members2) ).

cnf(prove_irreflexive_class_property4_1,negated_conjecture,
    subclass(x,complement(identity_relation)),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',prove_irreflexive_class_property4_1) ).

cnf(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',intersection1) ).

cnf(irreflexive2,axiom,
    ( irreflexive(X1,X2)
    | ~ subclass(restrict(X1,X2,X2),complement(identity_relation)) ),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',irreflexive2) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',not_subclass_members1) ).

cnf(prove_irreflexive_class_property4_2,negated_conjecture,
    ~ irreflexive(x,domain_of(symmetrization_of(x))),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',prove_irreflexive_class_property4_2) ).

cnf(restriction1,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',restriction1) ).

cnf(symmetrization,axiom,
    union(X1,inverse(X1)) = symmetrization_of(X1),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',symmetrization) ).

cnf(inverse,axiom,
    domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',inverse) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox2/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p',union) ).

cnf(c_0_11,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    inference(fof_simplification,[status(thm)],[subclass_members]) ).

cnf(c_0_12,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).

cnf(c_0_13,plain,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    c_0_11 ).

cnf(c_0_14,negated_conjecture,
    subclass(x,complement(identity_relation)),
    prove_irreflexive_class_property4_1 ).

cnf(c_0_15,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(fof_simplification,[status(thm)],[intersection1]) ).

cnf(c_0_16,plain,
    ( irreflexive(X1,X2)
    | ~ subclass(restrict(X1,X2,X2),complement(identity_relation)) ),
    inference(fof_simplification,[status(thm)],[irreflexive2]) ).

cnf(c_0_17,plain,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    c_0_12 ).

cnf(c_0_18,negated_conjecture,
    ( member(X1,complement(identity_relation))
    | ~ member(X1,x) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    c_0_15 ).

cnf(c_0_20,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    not_subclass_members1 ).

cnf(c_0_21,negated_conjecture,
    ~ irreflexive(x,domain_of(symmetrization_of(x))),
    inference(fof_simplification,[status(thm)],[prove_irreflexive_class_property4_2]) ).

cnf(c_0_22,plain,
    ( irreflexive(X1,X2)
    | ~ subclass(restrict(X1,X2,X2),complement(identity_relation)) ),
    c_0_16 ).

cnf(c_0_23,axiom,
    intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
    restriction1 ).

cnf(c_0_24,negated_conjecture,
    ( subclass(X1,complement(identity_relation))
    | ~ member(not_subclass_element(X1,complement(identity_relation)),x) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    ( member(not_subclass_element(intersection(X1,X2),X3),X1)
    | subclass(intersection(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    ~ irreflexive(x,domain_of(symmetrization_of(x))),
    c_0_21 ).

cnf(c_0_27,axiom,
    union(X1,inverse(X1)) = symmetrization_of(X1),
    symmetrization ).

cnf(c_0_28,axiom,
    domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
    inverse ).

cnf(c_0_29,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    union ).

cnf(c_0_30,plain,
    ( irreflexive(X1,X2)
    | ~ subclass(intersection(X1,cross_product(X2,X2)),complement(identity_relation)) ),
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    subclass(intersection(x,X1),complement(identity_relation)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    ~ irreflexive(x,domain_of(complement(intersection(complement(x),complement(domain_of(flip(cross_product(x,universal_class)))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    irreflexive(x,X1),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM042-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n011.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Fri May  3 09:27:33 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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/tmp/tmp.8NLqi56Hpm/E---3.1_27837.p
% 0.17/0.53  # Version: 3.1.0
% 0.17/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53  # Starting sh5l with 300s (1) cores
% 0.17/0.53  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27917 completed with status 0
% 0.17/0.53  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.53  # No SInE strategy applied
% 0.17/0.53  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.53  # Starting new_bool_1 with 308s (1) cores
% 0.17/0.53  # Starting sh5l with 304s (1) cores
% 0.17/0.53  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.53  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 27925 completed with status 0
% 0.17/0.53  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.53  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.53  # No SInE strategy applied
% 0.17/0.53  # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.17/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.17/0.53  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.53  # Preprocessing time       : 0.003 s
% 0.17/0.53  # Presaturation interreduction done
% 0.17/0.53  
% 0.17/0.53  # Proof found!
% 0.17/0.53  # SZS status Unsatisfiable
% 0.17/0.53  # SZS output start CNFRefutation
% See solution above
% 0.17/0.53  # Parsed axioms                        : 160
% 0.17/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.53  # Initial clauses                      : 160
% 0.17/0.53  # Removed in clause preprocessing      : 19
% 0.17/0.53  # Initial clauses in saturation        : 141
% 0.17/0.53  # Processed clauses                    : 646
% 0.17/0.53  # ...of these trivial                  : 1
% 0.17/0.53  # ...subsumed                          : 106
% 0.17/0.53  # ...remaining for further processing  : 539
% 0.17/0.53  # Other redundant clauses eliminated   : 10
% 0.17/0.53  # Clauses deleted for lack of memory   : 0
% 0.17/0.53  # Backward-subsumed                    : 30
% 0.17/0.53  # Backward-rewritten                   : 34
% 0.17/0.53  # Generated clauses                    : 1276
% 0.17/0.53  # ...of the previous two non-redundant : 1203
% 0.17/0.53  # ...aggressively subsumed             : 0
% 0.17/0.53  # Contextual simplify-reflections      : 5
% 0.17/0.53  # Paramodulations                      : 1262
% 0.17/0.53  # Factorizations                       : 4
% 0.17/0.53  # NegExts                              : 0
% 0.17/0.53  # Equation resolutions                 : 10
% 0.17/0.53  # Disequality decompositions           : 0
% 0.17/0.53  # Total rewrite steps                  : 271
% 0.17/0.53  # ...of those cached                   : 222
% 0.17/0.53  # Propositional unsat checks           : 0
% 0.17/0.53  #    Propositional check models        : 0
% 0.17/0.53  #    Propositional check unsatisfiable : 0
% 0.17/0.53  #    Propositional clauses             : 0
% 0.17/0.53  #    Propositional clauses after purity: 0
% 0.17/0.53  #    Propositional unsat core size     : 0
% 0.17/0.53  #    Propositional preprocessing time  : 0.000
% 0.17/0.53  #    Propositional encoding time       : 0.000
% 0.17/0.53  #    Propositional solver time         : 0.000
% 0.17/0.53  #    Success case prop preproc time    : 0.000
% 0.17/0.53  #    Success case prop encoding time   : 0.000
% 0.17/0.53  #    Success case prop solver time     : 0.000
% 0.17/0.53  # Current number of processed clauses  : 329
% 0.17/0.53  #    Positive orientable unit clauses  : 38
% 0.17/0.53  #    Positive unorientable unit clauses: 3
% 0.17/0.53  #    Negative unit clauses             : 0
% 0.17/0.53  #    Non-unit-clauses                  : 288
% 0.17/0.53  # Current number of unprocessed clauses: 792
% 0.17/0.53  # ...number of literals in the above   : 2568
% 0.17/0.53  # Current number of archived formulas  : 0
% 0.17/0.53  # Current number of archived clauses   : 223
% 0.17/0.53  # Clause-clause subsumption calls (NU) : 19590
% 0.17/0.53  # Rec. Clause-clause subsumption calls : 11696
% 0.17/0.53  # Non-unit clause-clause subsumptions  : 131
% 0.17/0.53  # Unit Clause-clause subsumption calls : 342
% 0.17/0.53  # Rewrite failures with RHS unbound    : 14
% 0.17/0.53  # BW rewrite match attempts            : 26
% 0.17/0.53  # BW rewrite match successes           : 13
% 0.17/0.53  # Condensation attempts                : 0
% 0.17/0.53  # Condensation successes               : 0
% 0.17/0.53  # Termbank termtop insertions          : 46049
% 0.17/0.53  # Search garbage collected termcells   : 287
% 0.17/0.53  
% 0.17/0.53  # -------------------------------------------------
% 0.17/0.53  # User time                : 0.063 s
% 0.17/0.53  # System time              : 0.008 s
% 0.17/0.53  # Total time               : 0.071 s
% 0.17/0.53  # Maximum resident set size: 2196 pages
% 0.17/0.53  
% 0.17/0.53  # -------------------------------------------------
% 0.17/0.53  # User time                : 0.315 s
% 0.17/0.53  # System time              : 0.019 s
% 0.17/0.53  # Total time               : 0.334 s
% 0.17/0.53  # Maximum resident set size: 1832 pages
% 0.17/0.53  % E---3.1 exiting
% 0.17/0.53  % E exiting
%------------------------------------------------------------------------------