TSTP Solution File: REL031-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : REL031-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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 09:13:46 EDT 2024

% Result   : Unsatisfiable 0.38s 0.60s
% Output   : CNFRefutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;  12 RR)
%            Number of literals    :   36 (  35 equ;   4 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   44 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',converse_multiplicativity_10) ).

cnf(converse_idempotence_8,axiom,
    converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',converse_idempotence_8) ).

cnf(composition_identity_6,axiom,
    composition(X1,one) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',composition_identity_6) ).

cnf(goals_15,negated_conjecture,
    join(composition(converse(sk2),sk2),one) = one,
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',goals_15) ).

cnf(maddux1_join_commutativity_1,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',maddux1_join_commutativity_1) ).

cnf(maddux2_join_associativity_2,axiom,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',maddux2_join_associativity_2) ).

cnf(composition_distributivity_7,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',composition_distributivity_7) ).

cnf(goals_14,negated_conjecture,
    join(composition(converse(sk1),sk1),one) = one,
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',goals_14) ).

cnf(goals_16,negated_conjecture,
    join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',goals_16) ).

cnf(converse_additivity_9,axiom,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',converse_additivity_9) ).

cnf(composition_associativity_5,axiom,
    composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
    file('/export/starexec/sandbox2/tmp/tmp.01PRE7s937/E---3.1_22608.p',composition_associativity_5) ).

cnf(c_0_11,axiom,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    converse_multiplicativity_10 ).

cnf(c_0_12,axiom,
    converse(converse(X1)) = X1,
    converse_idempotence_8 ).

cnf(c_0_13,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    composition(X1,one) = X1,
    composition_identity_6 ).

cnf(c_0_15,negated_conjecture,
    join(composition(converse(sk2),sk2),one) = one,
    goals_15 ).

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

cnf(c_0_17,plain,
    composition(converse(one),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).

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

cnf(c_0_19,negated_conjecture,
    join(one,composition(converse(sk2),sk2)) = one,
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    converse(one) = one,
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    join(one,join(composition(converse(sk2),sk2),X1)) = join(one,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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

cnf(c_0_23,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[c_0_17,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    join(composition(converse(sk1),sk1),one) = one,
    goals_14 ).

cnf(c_0_25,negated_conjecture,
    join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
    inference(fof_simplification,[status(thm)],[goals_16]) ).

cnf(c_0_26,negated_conjecture,
    join(one,composition(join(converse(sk2),X1),sk2)) = join(one,composition(X1,sk2)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_27,axiom,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    converse_additivity_9 ).

cnf(c_0_28,plain,
    join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    join(one,composition(converse(sk1),sk1)) = one,
    inference(rw,[status(thm)],[c_0_24,c_0_16]) ).

cnf(c_0_30,axiom,
    composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
    composition_associativity_5 ).

cnf(c_0_31,negated_conjecture,
    join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
    c_0_25 ).

cnf(c_0_32,negated_conjecture,
    join(one,composition(converse(join(sk2,X1)),sk2)) = join(one,composition(converse(X1),sk2)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    join(X1,composition(converse(sk1),composition(sk1,X1))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_23]) ).

cnf(c_0_34,negated_conjecture,
    join(one,composition(converse(composition(sk1,sk2)),composition(sk1,sk2))) != one,
    inference(rw,[status(thm)],[c_0_31,c_0_16]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19]),c_0_13]),c_0_30]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : REL031-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n002.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 09:59:12 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.51  Running first-order model finding
% 0.21/0.51  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.01PRE7s937/E---3.1_22608.p
% 0.38/0.60  # Version: 3.1.0
% 0.38/0.60  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.60  # Starting new_bool_3 with 300s (1) cores
% 0.38/0.60  # Starting new_bool_1 with 300s (1) cores
% 0.38/0.60  # Starting sh5l with 300s (1) cores
% 0.38/0.60  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22722 completed with status 0
% 0.38/0.60  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.60  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.60  # No SInE strategy applied
% 0.38/0.60  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.38/0.60  # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.60  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.38/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.60  # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.38/0.60  # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.38/0.60  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.38/0.60  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22731 completed with status 0
% 0.38/0.60  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.60  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.60  # No SInE strategy applied
% 0.38/0.60  # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.38/0.60  # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.60  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.38/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.60  # Preprocessing time       : 0.001 s
% 0.38/0.60  # Presaturation interreduction done
% 0.38/0.60  
% 0.38/0.60  # Proof found!
% 0.38/0.60  # SZS status Unsatisfiable
% 0.38/0.60  # SZS output start CNFRefutation
% See solution above
% 0.38/0.60  # Parsed axioms                        : 16
% 0.38/0.60  # Removed by relevancy pruning/SinE    : 0
% 0.38/0.60  # Initial clauses                      : 16
% 0.38/0.60  # Removed in clause preprocessing      : 1
% 0.38/0.60  # Initial clauses in saturation        : 15
% 0.38/0.60  # Processed clauses                    : 678
% 0.38/0.60  # ...of these trivial                  : 344
% 0.38/0.60  # ...subsumed                          : 50
% 0.38/0.60  # ...remaining for further processing  : 284
% 0.38/0.60  # Other redundant clauses eliminated   : 0
% 0.38/0.60  # Clauses deleted for lack of memory   : 0
% 0.38/0.60  # Backward-subsumed                    : 0
% 0.38/0.60  # Backward-rewritten                   : 62
% 0.38/0.60  # Generated clauses                    : 9756
% 0.38/0.60  # ...of the previous two non-redundant : 5136
% 0.38/0.60  # ...aggressively subsumed             : 0
% 0.38/0.60  # Contextual simplify-reflections      : 0
% 0.38/0.60  # Paramodulations                      : 9756
% 0.38/0.60  # Factorizations                       : 0
% 0.38/0.60  # NegExts                              : 0
% 0.38/0.60  # Equation resolutions                 : 0
% 0.38/0.60  # Disequality decompositions           : 0
% 0.38/0.60  # Total rewrite steps                  : 15646
% 0.38/0.60  # ...of those cached                   : 12430
% 0.38/0.60  # Propositional unsat checks           : 0
% 0.38/0.60  #    Propositional check models        : 0
% 0.38/0.60  #    Propositional check unsatisfiable : 0
% 0.38/0.60  #    Propositional clauses             : 0
% 0.38/0.60  #    Propositional clauses after purity: 0
% 0.38/0.60  #    Propositional unsat core size     : 0
% 0.38/0.60  #    Propositional preprocessing time  : 0.000
% 0.38/0.60  #    Propositional encoding time       : 0.000
% 0.38/0.60  #    Propositional solver time         : 0.000
% 0.38/0.60  #    Success case prop preproc time    : 0.000
% 0.38/0.60  #    Success case prop encoding time   : 0.000
% 0.38/0.60  #    Success case prop solver time     : 0.000
% 0.38/0.60  # Current number of processed clauses  : 207
% 0.38/0.60  #    Positive orientable unit clauses  : 202
% 0.38/0.60  #    Positive unorientable unit clauses: 4
% 0.38/0.60  #    Negative unit clauses             : 1
% 0.38/0.60  #    Non-unit-clauses                  : 0
% 0.38/0.60  # Current number of unprocessed clauses: 4402
% 0.38/0.60  # ...number of literals in the above   : 4402
% 0.38/0.60  # Current number of archived formulas  : 0
% 0.38/0.60  # Current number of archived clauses   : 78
% 0.38/0.60  # Clause-clause subsumption calls (NU) : 0
% 0.38/0.60  # Rec. Clause-clause subsumption calls : 0
% 0.38/0.60  # Non-unit clause-clause subsumptions  : 0
% 0.38/0.60  # Unit Clause-clause subsumption calls : 32
% 0.38/0.60  # Rewrite failures with RHS unbound    : 0
% 0.38/0.60  # BW rewrite match attempts            : 736
% 0.38/0.60  # BW rewrite match successes           : 101
% 0.38/0.60  # Condensation attempts                : 0
% 0.38/0.60  # Condensation successes               : 0
% 0.38/0.60  # Termbank termtop insertions          : 122098
% 0.38/0.60  # Search garbage collected termcells   : 2
% 0.38/0.60  
% 0.38/0.60  # -------------------------------------------------
% 0.38/0.60  # User time                : 0.065 s
% 0.38/0.60  # System time              : 0.006 s
% 0.38/0.60  # Total time               : 0.072 s
% 0.38/0.60  # Maximum resident set size: 1596 pages
% 0.38/0.60  
% 0.38/0.60  # -------------------------------------------------
% 0.38/0.60  # User time                : 0.317 s
% 0.38/0.60  # System time              : 0.033 s
% 0.38/0.60  # Total time               : 0.350 s
% 0.38/0.60  # Maximum resident set size: 1696 pages
% 0.38/0.60  % E---3.1 exiting
%------------------------------------------------------------------------------