TSTP Solution File: LAT091-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : LAT091-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 18:09:50 EDT 2023

% Result   : Unsatisfiable 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   40 (  40 unt;   0 nHn;   3 RR)
%            Number of literals    :   40 (  39 equ;   2 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   76 (  24 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wal_absorbtion_4,axiom,
    meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p',wal_absorbtion_4) ).

cnf(wal_absorbtion_5,axiom,
    join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p',wal_absorbtion_5) ).

cnf(wal_absorbtion_1,axiom,
    join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p',wal_absorbtion_1) ).

cnf(wal_absorbtion_3,axiom,
    join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
    file('/export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p',wal_absorbtion_3) ).

cnf(wal_absorbtion_2,axiom,
    join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p',wal_absorbtion_2) ).

cnf(prove_normal_axioms_4,negated_conjecture,
    join(b,a) != join(a,b),
    file('/export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p',prove_normal_axioms_4) ).

cnf(c_0_6,axiom,
    meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
    wal_absorbtion_4 ).

cnf(c_0_7,axiom,
    join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
    wal_absorbtion_5 ).

cnf(c_0_8,plain,
    meet(meet(join(X1,X2),X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,axiom,
    join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
    wal_absorbtion_1 ).

cnf(c_0_10,plain,
    meet(meet(X1,meet(X1,X2)),meet(X1,X2)) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,plain,
    join(join(meet(X1,X2),X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_12,plain,
    meet(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_6]) ).

cnf(c_0_13,axiom,
    join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
    wal_absorbtion_3 ).

cnf(c_0_14,plain,
    join(join(X1,X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    meet(join(X1,X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_6,c_0_12]) ).

cnf(c_0_16,axiom,
    join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
    wal_absorbtion_2 ).

cnf(c_0_17,plain,
    join(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12]) ).

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

cnf(c_0_19,plain,
    join(meet(X1,meet(X2,X1)),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_12]) ).

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

cnf(c_0_21,plain,
    meet(meet(X1,meet(X2,X1)),X1) = meet(X1,meet(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_17]) ).

cnf(c_0_22,plain,
    meet(X1,meet(X2,X1)) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_18]),c_0_18]) ).

cnf(c_0_23,plain,
    meet(meet(X1,X2),X2) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).

cnf(c_0_24,plain,
    meet(join(X1,X2),X1) = X1,
    inference(rw,[status(thm)],[c_0_8,c_0_23]) ).

cnf(c_0_25,plain,
    meet(meet(X1,join(X2,X1)),X1) = X1,
    inference(spm,[status(thm)],[c_0_6,c_0_17]) ).

cnf(c_0_26,plain,
    meet(X1,join(meet(X1,X2),X1)) = join(meet(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_24,c_0_11]) ).

cnf(c_0_27,plain,
    meet(join(meet(X1,X2),X1),X1) = X1,
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,plain,
    join(meet(X1,X2),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_27]),c_0_11]),c_0_27]),c_0_17]) ).

cnf(c_0_29,plain,
    meet(meet(X1,X2),X1) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_28]),c_0_17]) ).

cnf(c_0_30,plain,
    join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
    inference(spm,[status(thm)],[c_0_7,c_0_22]) ).

cnf(c_0_31,plain,
    meet(X1,join(X2,X1)) = X1,
    inference(rw,[status(thm)],[c_0_25,c_0_29]) ).

cnf(c_0_32,plain,
    join(X1,meet(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_29]) ).

cnf(c_0_33,plain,
    join(join(X1,meet(X2,join(X3,X1))),join(X3,X1)) = join(X3,X1),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,plain,
    meet(X1,join(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_29,c_0_24]) ).

cnf(c_0_35,plain,
    join(join(X1,X2),X1) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_32,c_0_24]) ).

cnf(c_0_36,plain,
    join(join(X1,X2),join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,negated_conjecture,
    join(b,a) != join(a,b),
    prove_normal_axioms_4 ).

cnf(c_0_38,plain,
    join(X1,X2) = join(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : LAT091-1 : TPTP v8.1.2. Released v2.6.0.
% 0.05/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n006.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon Oct  2 10:26:25 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.15/0.40  Running first-order model finding
% 0.15/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.KvAzJQ6ZTp/E---3.1_2816.p
% 0.15/0.42  # Version: 3.1pre001
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2893 completed with status 0
% 0.15/0.42  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # No SInE strategy applied
% 0.15/0.42  # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.42  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.42  # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.42  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.42  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.42  # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2902 completed with status 0
% 0.15/0.42  # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.42  # No SInE strategy applied
% 0.15/0.42  # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.42  # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42  # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.15/0.42  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.42  # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.42  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  # Presaturation interreduction done
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Unsatisfiable
% 0.15/0.42  # SZS output start CNFRefutation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 6
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.42  # Initial clauses                      : 6
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 6
% 0.15/0.42  # Processed clauses                    : 110
% 0.15/0.42  # ...of these trivial                  : 29
% 0.15/0.42  # ...subsumed                          : 5
% 0.15/0.42  # ...remaining for further processing  : 76
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 44
% 0.15/0.42  # Generated clauses                    : 2080
% 0.15/0.42  # ...of the previous two non-redundant : 661
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 2080
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Total rewrite steps                  : 2607
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 26
% 0.15/0.42  #    Positive orientable unit clauses  : 24
% 0.15/0.42  #    Positive unorientable unit clauses: 2
% 0.15/0.42  #    Negative unit clauses             : 0
% 0.15/0.42  #    Non-unit-clauses                  : 0
% 0.15/0.42  # Current number of unprocessed clauses: 514
% 0.15/0.42  # ...number of literals in the above   : 514
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 50
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.42  # Unit Clause-clause subsumption calls : 33
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 262
% 0.15/0.42  # BW rewrite match successes           : 150
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 13580
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.014 s
% 0.15/0.42  # System time              : 0.000 s
% 0.15/0.42  # Total time               : 0.014 s
% 0.15/0.42  # Maximum resident set size: 1512 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.048 s
% 0.15/0.42  # System time              : 0.011 s
% 0.15/0.42  # Total time               : 0.059 s
% 0.15/0.42  # Maximum resident set size: 1668 pages
% 0.15/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------