TSTP Solution File: REL005-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL005-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:23 EDT 2023
% Result : Unsatisfiable 0.37s 0.55s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 12
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 9 RR)
% Number of literals : 61 ( 60 equ; 4 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 75 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',composition_identity_6) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.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.OwcjFn186Q/E---3.1_23949.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.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.OwcjFn186Q/E---3.1_23949.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.OwcjFn186Q/E---3.1_23949.p',maddux2_join_associativity_2) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',converse_additivity_9) ).
cnf(goals_14,negated_conjecture,
converse(meet(sk1,sk2)) != meet(converse(sk1),converse(sk2)),
file('/export/starexec/sandbox2/tmp/tmp.OwcjFn186Q/E---3.1_23949.p',goals_14) ).
cnf(c_0_12,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_13,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_14,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_16,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13]) ).
cnf(c_0_17,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_19,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_21,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_22,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_26,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_23]) ).
cnf(c_0_27,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_29,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_30,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_32,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,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_31,c_0_26]),c_0_25]),c_0_27]),c_0_18]) ).
cnf(c_0_34,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_27]),c_0_18]) ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_26]) ).
cnf(c_0_37,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_38,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_39,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_40,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_37,c_0_13]) ).
cnf(c_0_41,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25]) ).
cnf(c_0_42,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_43,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
cnf(c_0_44,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[c_0_42,c_0_44]) ).
cnf(c_0_46,plain,
complement(join(complement(X1),complement(converse(complement(converse(complement(X1))))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_45]),c_0_27]),c_0_35]) ).
cnf(c_0_47,plain,
complement(join(X1,complement(converse(complement(converse(X1)))))) = complement(X1),
inference(spm,[status(thm)],[c_0_46,c_0_36]) ).
cnf(c_0_48,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_31]) ).
cnf(c_0_49,plain,
join(converse(X1),complement(converse(complement(X1)))) = converse(X1),
inference(spm,[status(thm)],[c_0_48,c_0_13]) ).
cnf(c_0_50,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_48]),c_0_13]),c_0_13]) ).
cnf(c_0_51,plain,
join(complement(converse(X1)),converse(complement(X1))) = converse(complement(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_36]),c_0_18]) ).
cnf(c_0_52,plain,
join(complement(X1),converse(complement(converse(X1)))) = complement(X1),
inference(spm,[status(thm)],[c_0_50,c_0_36]) ).
cnf(c_0_53,plain,
converse(complement(converse(X1))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_13]),c_0_52]) ).
cnf(c_0_54,negated_conjecture,
converse(meet(sk1,sk2)) != meet(converse(sk1),converse(sk2)),
goals_14 ).
cnf(c_0_55,plain,
converse(complement(X1)) = complement(converse(X1)),
inference(spm,[status(thm)],[c_0_13,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
converse(complement(join(complement(sk1),complement(sk2)))) != complement(join(complement(converse(sk1)),complement(converse(sk2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_21]),c_0_21]) ).
cnf(c_0_57,plain,
join(complement(converse(X1)),converse(X2)) = converse(join(complement(X1),X2)),
inference(spm,[status(thm)],[c_0_37,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
complement(join(complement(converse(sk1)),complement(converse(sk2)))) != complement(converse(join(complement(sk1),complement(sk2)))),
inference(rw,[status(thm)],[c_0_56,c_0_55]) ).
cnf(c_0_59,plain,
join(complement(converse(X1)),complement(converse(X2))) = converse(join(complement(X1),complement(X2))),
inference(spm,[status(thm)],[c_0_57,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : REL005-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n014.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 15:12:19 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.37/0.52 Running first-order theorem proving
% 0.37/0.52 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.OwcjFn186Q/E---3.1_23949.p
% 0.37/0.55 # Version: 3.1pre001
% 0.37/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55 # Starting sh5l with 300s (1) cores
% 0.37/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24027 completed with status 0
% 0.37/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.55 # No SInE strategy applied
% 0.37/0.55 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.37/0.55 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.37/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/0.55 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.37/0.55 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.37/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.37/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 24035 completed with status 0
% 0.37/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.55 # No SInE strategy applied
% 0.37/0.55 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.37/0.55 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.37/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/0.55 # Preprocessing time : 0.001 s
% 0.37/0.55 # Presaturation interreduction done
% 0.37/0.55
% 0.37/0.55 # Proof found!
% 0.37/0.55 # SZS status Unsatisfiable
% 0.37/0.55 # SZS output start CNFRefutation
% See solution above
% 0.37/0.55 # Parsed axioms : 14
% 0.37/0.55 # Removed by relevancy pruning/SinE : 0
% 0.37/0.55 # Initial clauses : 14
% 0.37/0.55 # Removed in clause preprocessing : 1
% 0.37/0.55 # Initial clauses in saturation : 13
% 0.37/0.55 # Processed clauses : 211
% 0.37/0.55 # ...of these trivial : 81
% 0.37/0.55 # ...subsumed : 28
% 0.37/0.55 # ...remaining for further processing : 102
% 0.37/0.55 # Other redundant clauses eliminated : 0
% 0.37/0.55 # Clauses deleted for lack of memory : 0
% 0.37/0.55 # Backward-subsumed : 0
% 0.37/0.55 # Backward-rewritten : 28
% 0.37/0.55 # Generated clauses : 1826
% 0.37/0.55 # ...of the previous two non-redundant : 1145
% 0.37/0.55 # ...aggressively subsumed : 0
% 0.37/0.55 # Contextual simplify-reflections : 0
% 0.37/0.55 # Paramodulations : 1826
% 0.37/0.55 # Factorizations : 0
% 0.37/0.55 # NegExts : 0
% 0.37/0.55 # Equation resolutions : 0
% 0.37/0.55 # Total rewrite steps : 2498
% 0.37/0.55 # Propositional unsat checks : 0
% 0.37/0.55 # Propositional check models : 0
% 0.37/0.55 # Propositional check unsatisfiable : 0
% 0.37/0.55 # Propositional clauses : 0
% 0.37/0.55 # Propositional clauses after purity: 0
% 0.37/0.55 # Propositional unsat core size : 0
% 0.37/0.55 # Propositional preprocessing time : 0.000
% 0.37/0.55 # Propositional encoding time : 0.000
% 0.37/0.55 # Propositional solver time : 0.000
% 0.37/0.55 # Success case prop preproc time : 0.000
% 0.37/0.55 # Success case prop encoding time : 0.000
% 0.37/0.55 # Success case prop solver time : 0.000
% 0.37/0.55 # Current number of processed clauses : 61
% 0.37/0.55 # Positive orientable unit clauses : 58
% 0.37/0.55 # Positive unorientable unit clauses: 3
% 0.37/0.55 # Negative unit clauses : 0
% 0.37/0.55 # Non-unit-clauses : 0
% 0.37/0.55 # Current number of unprocessed clauses: 915
% 0.37/0.55 # ...number of literals in the above : 915
% 0.37/0.55 # Current number of archived formulas : 0
% 0.37/0.55 # Current number of archived clauses : 42
% 0.37/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.37/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.37/0.55 # Non-unit clause-clause subsumptions : 0
% 0.37/0.55 # Unit Clause-clause subsumption calls : 4
% 0.37/0.55 # Rewrite failures with RHS unbound : 0
% 0.37/0.55 # BW rewrite match attempts : 119
% 0.37/0.55 # BW rewrite match successes : 55
% 0.37/0.55 # Condensation attempts : 0
% 0.37/0.55 # Condensation successes : 0
% 0.37/0.55 # Termbank termtop insertions : 18771
% 0.37/0.55
% 0.37/0.55 # -------------------------------------------------
% 0.37/0.55 # User time : 0.018 s
% 0.37/0.55 # System time : 0.002 s
% 0.37/0.55 # Total time : 0.020 s
% 0.37/0.55 # Maximum resident set size: 1572 pages
% 0.37/0.55
% 0.37/0.55 # -------------------------------------------------
% 0.37/0.55 # User time : 0.072 s
% 0.37/0.55 # System time : 0.013 s
% 0.37/0.55 # Total time : 0.086 s
% 0.37/0.55 # Maximum resident set size: 1676 pages
% 0.37/0.55 % E---3.1 exiting
% 0.37/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------