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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : REL023-1 : TPTP v8.2.0. Released v4.0.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 : Tue May 21 02:31:35 EDT 2024

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   52 (  52 unt;   0 nHn;   9 RR)
%            Number of literals    :   52 (  51 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   72 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(maddux2_join_associativity_2,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).

cnf(def_top_12,axiom,
    top = join(X1,complement(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_top_12) ).

cnf(maddux4_definiton_of_meet_4,axiom,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).

cnf(def_zero_13,axiom,
    zero = meet(X1,complement(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).

cnf(maddux1_join_commutativity_1,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).

cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).

cnf(goals_14,negated_conjecture,
    join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).

cnf(composition_distributivity_7,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).

cnf(c_0_8,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    maddux2_join_associativity_2 ).

cnf(c_0_9,axiom,
    top = join(X1,complement(X1)),
    def_top_12 ).

cnf(c_0_10,axiom,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    maddux4_definiton_of_meet_4 ).

cnf(c_0_11,axiom,
    zero = meet(X1,complement(X1)),
    def_zero_13 ).

cnf(c_0_12,plain,
    join(X1,join(complement(X1),X2)) = join(top,X2),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,axiom,
    join(X1,X2) = join(X2,X1),
    maddux1_join_commutativity_1 ).

cnf(c_0_14,axiom,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    maddux3_a_kind_of_de_Morgan_3 ).

cnf(c_0_15,plain,
    complement(top) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).

cnf(c_0_16,plain,
    join(X1,join(X2,complement(X1))) = join(top,X2),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[c_0_14,c_0_10]) ).

cnf(c_0_18,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_19,plain,
    complement(join(zero,complement(X1))) = meet(top,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_15]) ).

cnf(c_0_20,plain,
    meet(X1,X2) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_10]) ).

cnf(c_0_21,plain,
    join(top,zero) = top,
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_22,plain,
    join(top,meet(X1,X2)) = join(top,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_8]),c_0_18]),c_0_12]) ).

cnf(c_0_23,plain,
    meet(meet(top,X1),join(zero,complement(X1))) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_20]) ).

cnf(c_0_24,plain,
    join(top,join(zero,X1)) = join(top,X1),
    inference(spm,[status(thm)],[c_0_8,c_0_21]) ).

cnf(c_0_25,plain,
    join(top,complement(complement(X1))) = join(X1,top),
    inference(spm,[status(thm)],[c_0_12,c_0_9]) ).

cnf(c_0_26,plain,
    join(top,complement(X1)) = top,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_24]) ).

cnf(c_0_27,plain,
    join(X1,top) = top,
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,plain,
    join(zero,meet(X1,top)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_15]),c_0_13]) ).

cnf(c_0_29,plain,
    join(zero,meet(top,X1)) = X1,
    inference(spm,[status(thm)],[c_0_28,c_0_20]) ).

cnf(c_0_30,plain,
    join(zero,zero) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_11]),c_0_15]) ).

cnf(c_0_31,plain,
    join(zero,join(zero,X1)) = join(zero,X1),
    inference(spm,[status(thm)],[c_0_8,c_0_30]) ).

cnf(c_0_32,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_31,c_0_29]) ).

cnf(c_0_33,plain,
    complement(complement(X1)) = meet(top,X1),
    inference(rw,[status(thm)],[c_0_19,c_0_32]) ).

cnf(c_0_34,plain,
    meet(top,X1) = X1,
    inference(rw,[status(thm)],[c_0_29,c_0_32]) ).

cnf(c_0_35,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_36,plain,
    complement(join(X1,complement(X2))) = meet(complement(X1),X2),
    inference(spm,[status(thm)],[c_0_10,c_0_35]) ).

cnf(c_0_37,plain,
    join(zero,meet(X1,X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_10]) ).

cnf(c_0_38,negated_conjecture,
    join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)),
    inference(fof_simplification,[status(thm)],[goals_14]) ).

cnf(c_0_39,plain,
    complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,plain,
    meet(X1,X1) = X1,
    inference(rw,[status(thm)],[c_0_37,c_0_32]) ).

cnf(c_0_41,negated_conjecture,
    join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)),
    c_0_38 ).

cnf(c_0_42,plain,
    join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_8]) ).

cnf(c_0_43,plain,
    join(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35]),c_0_35]) ).

cnf(c_0_44,plain,
    join(meet(X1,X2),meet(X1,complement(X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_13]) ).

cnf(c_0_45,negated_conjecture,
    join(composition(sk1,meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),meet(sk2,sk3))) != composition(sk1,meet(sk2,sk3)),
    inference(rw,[status(thm)],[c_0_41,c_0_13]) ).

cnf(c_0_46,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    composition_distributivity_7 ).

cnf(c_0_47,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_8]),c_0_43]) ).

cnf(c_0_48,plain,
    join(meet(X1,X2),meet(complement(X2),X1)) = X1,
    inference(spm,[status(thm)],[c_0_44,c_0_20]) ).

cnf(c_0_49,negated_conjecture,
    composition(join(sk1,meet(sk1,converse(sk2))),meet(sk2,sk3)) != composition(sk1,meet(sk2,sk3)),
    inference(rw,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,plain,
    join(X1,meet(X1,X2)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_13]) ).

cnf(c_0_51,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : REL023-1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 08:23:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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.20/0.51  # Version: 3.1.0
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # sh5l with pid 3353 completed with status 0
% 0.20/0.51  # Result found by sh5l
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.20/0.51  # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 3362 completed with status 0
% 0.20/0.51  # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.20/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.001 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Unsatisfiable
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 14
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 1
% 0.20/0.51  # Initial clauses                      : 13
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 13
% 0.20/0.51  # Processed clauses                    : 202
% 0.20/0.51  # ...of these trivial                  : 75
% 0.20/0.51  # ...subsumed                          : 25
% 0.20/0.51  # ...remaining for further processing  : 102
% 0.20/0.51  # Other redundant clauses eliminated   : 0
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 0
% 0.20/0.51  # Backward-rewritten                   : 39
% 0.20/0.51  # Generated clauses                    : 1175
% 0.20/0.51  # ...of the previous two non-redundant : 825
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 0
% 0.20/0.51  # Paramodulations                      : 1175
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 0
% 0.20/0.51  # Disequality decompositions           : 0
% 0.20/0.51  # Total rewrite steps                  : 1235
% 0.20/0.51  # ...of those cached                   : 853
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 50
% 0.20/0.51  #    Positive orientable unit clauses  : 46
% 0.20/0.51  #    Positive unorientable unit clauses: 4
% 0.20/0.51  #    Negative unit clauses             : 0
% 0.20/0.51  #    Non-unit-clauses                  : 0
% 0.20/0.51  # Current number of unprocessed clauses: 615
% 0.20/0.51  # ...number of literals in the above   : 615
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 52
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.51  # Unit Clause-clause subsumption calls : 3
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 141
% 0.20/0.51  # BW rewrite match successes           : 78
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 9655
% 0.20/0.51  # Search garbage collected termcells   : 5
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.014 s
% 0.20/0.51  # System time              : 0.003 s
% 0.20/0.51  # Total time               : 0.017 s
% 0.20/0.51  # Maximum resident set size: 1628 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.016 s
% 0.20/0.51  # System time              : 0.005 s
% 0.20/0.51  # Total time               : 0.021 s
% 0.20/0.51  # Maximum resident set size: 1704 pages
% 0.20/0.51  % E---3.1 exiting
% 0.20/0.51  % E exiting
%------------------------------------------------------------------------------