TSTP Solution File: REL050-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL050-3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:14:37 EDT 2023
% Result : Unsatisfiable 0.17s 0.71s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 14
% Syntax : Number of clauses : 75 ( 75 unt; 0 nHn; 8 RR)
% Number of literals : 75 ( 74 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 105 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',composition_identity_6) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.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/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.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/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',maddux2_join_associativity_2) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',converse_additivity_9) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',composition_distributivity_7) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',composition_associativity_5) ).
cnf(goals_17,negated_conjecture,
complement(composition(sk1,top)) != composition(complement(composition(sk1,top)),top),
file('/export/starexec/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p',goals_17) ).
cnf(c_0_14,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_15,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_16,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_18,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_19,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_21,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_23,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_24,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_26,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_28,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_25]) ).
cnf(c_0_29,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_31,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_32,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_34,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,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_33,c_0_27]),c_0_28]),c_0_29]),c_0_20]) ).
cnf(c_0_36,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_39,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_40,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_20]) ).
cnf(c_0_41,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_42,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_43,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_28]),c_0_27]) ).
cnf(c_0_45,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_46,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_47,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_27]),c_0_44]) ).
cnf(c_0_48,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_49,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_33,c_0_33]),c_0_37]),c_0_20]),c_0_31]),c_0_46]) ).
cnf(c_0_50,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_20,c_0_47]) ).
cnf(c_0_51,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_52,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_53,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
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_52,c_0_52]),c_0_39]) ).
cnf(c_0_55,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_27]),c_0_53]) ).
cnf(c_0_56,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_36]) ).
cnf(c_0_57,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_58,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_29]),c_0_56]) ).
cnf(c_0_59,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_57,c_0_25]) ).
cnf(c_0_60,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_58]),c_0_15]),c_0_15]) ).
cnf(c_0_61,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_59,c_0_47]) ).
cnf(c_0_62,plain,
join(complement(X1),converse(complement(converse(X1)))) = complement(X1),
inference(spm,[status(thm)],[c_0_60,c_0_37]) ).
cnf(c_0_63,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_64,plain,
composition(top,top) = top,
inference(spm,[status(thm)],[c_0_50,c_0_61]) ).
cnf(c_0_65,plain,
complement(converse(complement(converse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_62]),c_0_37]),c_0_20]),c_0_58]) ).
cnf(c_0_66,plain,
composition(top,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
converse(complement(converse(X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_37,c_0_65]) ).
cnf(c_0_68,plain,
composition(top,complement(composition(top,X1))) = complement(composition(top,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_66]),c_0_53]),c_0_61]) ).
cnf(c_0_69,plain,
composition(top,converse(X1)) = converse(composition(X1,top)),
inference(spm,[status(thm)],[c_0_14,c_0_53]) ).
cnf(c_0_70,plain,
complement(converse(X1)) = converse(complement(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_67]) ).
cnf(c_0_71,plain,
converse(composition(complement(composition(X1,top)),top)) = converse(complement(composition(X1,top))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_69]),c_0_70]) ).
cnf(c_0_72,negated_conjecture,
complement(composition(sk1,top)) != composition(complement(composition(sk1,top)),top),
goals_17 ).
cnf(c_0_73,plain,
composition(complement(composition(X1,top)),top) = complement(composition(X1,top)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_71]),c_0_15]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : REL050-3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.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:22:53 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.OGkKx1Jwad/E---3.1_17922.p
% 0.17/0.71 # Version: 3.1pre001
% 0.17/0.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.71 # Starting sh5l with 300s (1) cores
% 0.17/0.71 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18034 completed with status 0
% 0.17/0.71 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.71 # No SInE strategy applied
% 0.17/0.71 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.17/0.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.71 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.17/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.71 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.17/0.71 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.71 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.71 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 18038 completed with status 0
% 0.17/0.71 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.17/0.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.71 # No SInE strategy applied
% 0.17/0.71 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.17/0.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.71 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.17/0.71 # Preprocessing time : 0.001 s
% 0.17/0.71 # Presaturation interreduction done
% 0.17/0.71
% 0.17/0.71 # Proof found!
% 0.17/0.71 # SZS status Unsatisfiable
% 0.17/0.71 # SZS output start CNFRefutation
% See solution above
% 0.17/0.71 # Parsed axioms : 17
% 0.17/0.71 # Removed by relevancy pruning/SinE : 0
% 0.17/0.71 # Initial clauses : 17
% 0.17/0.71 # Removed in clause preprocessing : 1
% 0.17/0.71 # Initial clauses in saturation : 16
% 0.17/0.71 # Processed clauses : 1356
% 0.17/0.71 # ...of these trivial : 848
% 0.17/0.71 # ...subsumed : 138
% 0.17/0.71 # ...remaining for further processing : 370
% 0.17/0.71 # Other redundant clauses eliminated : 0
% 0.17/0.71 # Clauses deleted for lack of memory : 0
% 0.17/0.71 # Backward-subsumed : 0
% 0.17/0.71 # Backward-rewritten : 87
% 0.17/0.71 # Generated clauses : 30121
% 0.17/0.71 # ...of the previous two non-redundant : 14828
% 0.17/0.71 # ...aggressively subsumed : 0
% 0.17/0.71 # Contextual simplify-reflections : 0
% 0.17/0.71 # Paramodulations : 30121
% 0.17/0.71 # Factorizations : 0
% 0.17/0.71 # NegExts : 0
% 0.17/0.71 # Equation resolutions : 0
% 0.17/0.71 # Total rewrite steps : 58507
% 0.17/0.71 # Propositional unsat checks : 0
% 0.17/0.71 # Propositional check models : 0
% 0.17/0.71 # Propositional check unsatisfiable : 0
% 0.17/0.71 # Propositional clauses : 0
% 0.17/0.71 # Propositional clauses after purity: 0
% 0.17/0.71 # Propositional unsat core size : 0
% 0.17/0.71 # Propositional preprocessing time : 0.000
% 0.17/0.71 # Propositional encoding time : 0.000
% 0.17/0.71 # Propositional solver time : 0.000
% 0.17/0.71 # Success case prop preproc time : 0.000
% 0.17/0.71 # Success case prop encoding time : 0.000
% 0.17/0.71 # Success case prop solver time : 0.000
% 0.17/0.71 # Current number of processed clauses : 267
% 0.17/0.71 # Positive orientable unit clauses : 259
% 0.17/0.71 # Positive unorientable unit clauses: 8
% 0.17/0.71 # Negative unit clauses : 0
% 0.17/0.71 # Non-unit-clauses : 0
% 0.17/0.71 # Current number of unprocessed clauses: 13244
% 0.17/0.71 # ...number of literals in the above : 13244
% 0.17/0.71 # Current number of archived formulas : 0
% 0.17/0.71 # Current number of archived clauses : 104
% 0.17/0.71 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.71 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.71 # Non-unit clause-clause subsumptions : 0
% 0.17/0.71 # Unit Clause-clause subsumption calls : 63
% 0.17/0.71 # Rewrite failures with RHS unbound : 0
% 0.17/0.71 # BW rewrite match attempts : 1234
% 0.17/0.71 # BW rewrite match successes : 275
% 0.17/0.71 # Condensation attempts : 0
% 0.17/0.71 # Condensation successes : 0
% 0.17/0.71 # Termbank termtop insertions : 374976
% 0.17/0.71
% 0.17/0.71 # -------------------------------------------------
% 0.17/0.71 # User time : 0.245 s
% 0.17/0.71 # System time : 0.010 s
% 0.17/0.71 # Total time : 0.255 s
% 0.17/0.71 # Maximum resident set size: 1636 pages
% 0.17/0.71
% 0.17/0.71 # -------------------------------------------------
% 0.17/0.71 # User time : 1.179 s
% 0.17/0.71 # System time : 0.026 s
% 0.17/0.71 # Total time : 1.206 s
% 0.17/0.71 # Maximum resident set size: 1680 pages
% 0.17/0.71 % E---3.1 exiting
%------------------------------------------------------------------------------