TSTP Solution File: REL017-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL017-3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 19:13:32 EDT 2023
% Result : Unsatisfiable 1240.76s 167.34s
% Output : CNFRefutation 1240.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of clauses : 60 ( 60 unt; 0 nHn; 9 RR)
% Number of literals : 60 ( 59 equ; 5 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 : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 95 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',def_top_12) ).
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/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.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.sCI3v0UOyY/E---3.1_8000.p',composition_distributivity_7) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',converse_additivity_9) ).
cnf(goals_17,negated_conjecture,
join(complement(composition(sk1,sk2)),composition(sk1,sk3)) != join(complement(composition(sk1,meet(sk2,complement(sk3)))),composition(sk1,sk3)),
file('/export/starexec/sandbox2/tmp/tmp.sCI3v0UOyY/E---3.1_8000.p',goals_17) ).
cnf(c_0_13,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_14,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_15,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_17,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_20,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_22,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_23,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_25,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_27,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_24]) ).
cnf(c_0_28,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_30,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_31,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_33,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_26]),c_0_28]),c_0_19]) ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_39,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_19]) ).
cnf(c_0_40,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_38,c_0_19]) ).
cnf(c_0_41,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_42,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_43,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
composition(converse(X1),join(converse(X2),converse(X3))) = join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_41]),c_0_42]),c_0_13]),c_0_13]),c_0_42]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_30]) ).
cnf(c_0_46,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_47,plain,
composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
inference(spm,[status(thm)],[c_0_44,c_0_16]) ).
cnf(c_0_48,plain,
join(complement(X1),complement(join(complement(X1),complement(X2)))) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_32]),c_0_36]),c_0_45]),c_0_19]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
join(complement(composition(sk1,sk2)),composition(sk1,sk3)) != join(complement(composition(sk1,meet(sk2,complement(sk3)))),composition(sk1,sk3)),
goals_17 ).
cnf(c_0_50,plain,
composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_47,c_0_16]) ).
cnf(c_0_51,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_48,c_0_36]) ).
cnf(c_0_52,negated_conjecture,
join(complement(composition(sk1,sk2)),composition(sk1,sk3)) != join(complement(composition(sk1,complement(join(complement(sk2),complement(complement(sk3)))))),composition(sk1,sk3)),
inference(rw,[status(thm)],[c_0_49,c_0_22]) ).
cnf(c_0_53,plain,
composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_50,c_0_16]) ).
cnf(c_0_54,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_51]),c_0_38]) ).
cnf(c_0_55,negated_conjecture,
join(composition(sk1,sk3),complement(composition(sk1,complement(join(complement(sk2),complement(complement(sk3))))))) != join(complement(composition(sk1,sk2)),composition(sk1,sk3)),
inference(rw,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_56,plain,
join(composition(X1,X2),composition(X1,complement(join(X2,X3)))) = join(composition(X1,X2),composition(X1,complement(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
join(composition(sk1,sk3),complement(composition(sk1,complement(join(sk3,complement(sk2)))))) != join(complement(composition(sk1,sk2)),composition(sk1,sk3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_36]),c_0_19]) ).
cnf(c_0_58,plain,
join(composition(X1,X2),complement(composition(X1,complement(join(X2,X3))))) = join(composition(X1,X2),complement(composition(X1,complement(X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_56]),c_0_54]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_36]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : REL017-3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 15:21:19 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.sCI3v0UOyY/E---3.1_8000.p
% 1240.76/167.34 # Version: 3.1pre001
% 1240.76/167.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1240.76/167.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1240.76/167.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1240.76/167.34 # Starting new_bool_3 with 300s (1) cores
% 1240.76/167.34 # Starting new_bool_1 with 300s (1) cores
% 1240.76/167.34 # Starting sh5l with 300s (1) cores
% 1240.76/167.34 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8078 completed with status 0
% 1240.76/167.34 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1240.76/167.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1240.76/167.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1240.76/167.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1240.76/167.34 # No SInE strategy applied
% 1240.76/167.34 # Search class: FUUPM-FFMF21-DFFFFFNN
% 1240.76/167.34 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1240.76/167.34 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 1240.76/167.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1240.76/167.34 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 1240.76/167.34 # Starting new_bool_3 with 136s (1) cores
% 1240.76/167.34 # Starting new_bool_1 with 136s (1) cores
% 1240.76/167.34 # new_bool_3 with pid 8088 completed with status 7
% 1240.76/167.34 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 130s (1) cores
% 1240.76/167.34 # new_bool_1 with pid 8089 completed with status 7
% 1240.76/167.34 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 8086 completed with status 7
% 1240.76/167.34 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8085 completed with status 7
% 1240.76/167.34 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 8101 completed with status 0
% 1240.76/167.34 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 1240.76/167.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1240.76/167.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1240.76/167.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1240.76/167.34 # No SInE strategy applied
% 1240.76/167.34 # Search class: FUUPM-FFMF21-DFFFFFNN
% 1240.76/167.34 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1240.76/167.34 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 1240.76/167.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1240.76/167.34 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 1240.76/167.34 # Starting new_bool_3 with 136s (1) cores
% 1240.76/167.34 # Starting new_bool_1 with 136s (1) cores
% 1240.76/167.34 # new_bool_3 with pid 8088 completed with status 7
% 1240.76/167.34 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 130s (1) cores
% 1240.76/167.34 # Preprocessing time : 0.001 s
% 1240.76/167.34
% 1240.76/167.34 # Proof found!
% 1240.76/167.34 # SZS status Unsatisfiable
% 1240.76/167.34 # SZS output start CNFRefutation
% See solution above
% 1240.76/167.34 # Parsed axioms : 17
% 1240.76/167.34 # Removed by relevancy pruning/SinE : 0
% 1240.76/167.34 # Initial clauses : 17
% 1240.76/167.34 # Removed in clause preprocessing : 1
% 1240.76/167.34 # Initial clauses in saturation : 16
% 1240.76/167.34 # Processed clauses : 28599
% 1240.76/167.34 # ...of these trivial : 17584
% 1240.76/167.34 # ...subsumed : 9091
% 1240.76/167.34 # ...remaining for further processing : 1924
% 1240.76/167.34 # Other redundant clauses eliminated : 0
% 1240.76/167.34 # Clauses deleted for lack of memory : 0
% 1240.76/167.34 # Backward-subsumed : 1
% 1240.76/167.34 # Backward-rewritten : 283
% 1240.76/167.34 # Generated clauses : 1368065
% 1240.76/167.34 # ...of the previous two non-redundant : 703111
% 1240.76/167.34 # ...aggressively subsumed : 0
% 1240.76/167.34 # Contextual simplify-reflections : 0
% 1240.76/167.34 # Paramodulations : 1368065
% 1240.76/167.34 # Factorizations : 0
% 1240.76/167.34 # NegExts : 0
% 1240.76/167.34 # Equation resolutions : 0
% 1240.76/167.34 # Total rewrite steps : 5981723
% 1240.76/167.34 # Propositional unsat checks : 0
% 1240.76/167.34 # Propositional check models : 0
% 1240.76/167.34 # Propositional check unsatisfiable : 0
% 1240.76/167.34 # Propositional clauses : 0
% 1240.76/167.34 # Propositional clauses after purity: 0
% 1240.76/167.34 # Propositional unsat core size : 0
% 1240.76/167.34 # Propositional preprocessing time : 0.000
% 1240.76/167.34 # Propositional encoding time : 0.000
% 1240.76/167.34 # Propositional solver time : 0.000
% 1240.76/167.34 # Success case prop preproc time : 0.000
% 1240.76/167.34 # Success case prop encoding time : 0.000
% 1240.76/167.34 # Success case prop solver time : 0.000
% 1240.76/167.34 # Current number of processed clauses : 1640
% 1240.76/167.34 # Positive orientable unit clauses : 1631
% 1240.76/167.34 # Positive unorientable unit clauses: 8
% 1240.76/167.34 # Negative unit clauses : 1
% 1240.76/167.34 # Non-unit-clauses : 0
% 1240.76/167.34 # Current number of unprocessed clauses: 670485
% 1240.76/167.34 # ...number of literals in the above : 670485
% 1240.76/167.34 # Current number of archived formulas : 0
% 1240.76/167.34 # Current number of archived clauses : 285
% 1240.76/167.34 # Clause-clause subsumption calls (NU) : 0
% 1240.76/167.34 # Rec. Clause-clause subsumption calls : 0
% 1240.76/167.34 # Non-unit clause-clause subsumptions : 0
% 1240.76/167.34 # Unit Clause-clause subsumption calls : 839
% 1240.76/167.34 # Rewrite failures with RHS unbound : 6368
% 1240.76/167.34 # BW rewrite match attempts : 52895
% 1240.76/167.34 # BW rewrite match successes : 4112
% 1240.76/167.34 # Condensation attempts : 0
% 1240.76/167.34 # Condensation successes : 0
% 1240.76/167.34 # Termbank termtop insertions : 35174444
% 1240.76/167.34
% 1240.76/167.34 # -------------------------------------------------
% 1240.76/167.34 # User time : 580.617 s
% 1240.76/167.34 # System time : 5.073 s
% 1240.76/167.34 # Total time : 585.690 s
% 1240.76/167.34 # Maximum resident set size: 1652 pages
% 1240.76/167.34
% 1240.76/167.34 # -------------------------------------------------
% 1240.76/167.34 # User time : 743.797 s
% 1240.76/167.34 # System time : 7.371 s
% 1240.76/167.34 # Total time : 751.169 s
% 1240.76/167.34 # Maximum resident set size: 1684 pages
% 1240.76/167.34 % E---3.1 exiting
% 1240.76/167.34 % E---3.1 exiting
%------------------------------------------------------------------------------