TSTP Solution File: REL027-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL027-2 : 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:18 EDT 2023
% Result : Unsatisfiable 0.22s 0.62s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 56 ( 52 unt; 0 nHn; 11 RR)
% Number of literals : 60 ( 59 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 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 : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.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.JNGfwpijTy/E---3.1_26662.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.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.JNGfwpijTy/E---3.1_26662.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',def_top_12) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',composition_distributivity_7) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',converse_additivity_9) ).
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.JNGfwpijTy/E---3.1_26662.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.JNGfwpijTy/E---3.1_26662.p',maddux2_join_associativity_2) ).
cnf(goals_14,negated_conjecture,
join(sk1,one) = one,
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',goals_14) ).
cnf(goals_15,negated_conjecture,
( join(meet(complement(sk1),one),meet(complement(composition(sk1,top)),one)) != meet(complement(composition(sk1,top)),one)
| join(meet(complement(composition(sk1,top)),one),meet(complement(sk1),one)) != meet(complement(sk1),one) ),
file('/export/starexec/sandbox2/tmp/tmp.JNGfwpijTy/E---3.1_26662.p',goals_15) ).
cnf(c_0_14,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_15,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_16,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_18,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
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_15,c_0_18]) ).
cnf(c_0_22,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_23,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_24,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_25,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_26,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_27,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_28,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_29,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_21]),c_0_23]) ).
cnf(c_0_30,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_32,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_14,c_0_27]),c_0_28]),c_0_14]),c_0_14]),c_0_28]) ).
cnf(c_0_33,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_34,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_36,plain,
composition(converse(X1),join(one,converse(X2))) = join(converse(X1),composition(converse(X1),converse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_15]),c_0_20]),c_0_20]) ).
cnf(c_0_37,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,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_35,c_0_29]),c_0_26]),c_0_30]),c_0_20]) ).
cnf(c_0_39,negated_conjecture,
join(sk1,one) = one,
goals_14 ).
cnf(c_0_40,plain,
composition(X1,join(one,converse(X2))) = join(X1,composition(X1,converse(X2))),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_41,plain,
join(composition(X1,X2),composition(complement(X1),X2)) = composition(top,X2),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_42,negated_conjecture,
( join(meet(complement(sk1),one),meet(complement(composition(sk1,top)),one)) != meet(complement(composition(sk1,top)),one)
| join(meet(complement(composition(sk1,top)),one),meet(complement(sk1),one)) != meet(complement(sk1),one) ),
goals_15 ).
cnf(c_0_43,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_33]) ).
cnf(c_0_45,negated_conjecture,
join(X1,composition(sk1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_39]),c_0_23]),c_0_20]),c_0_23]) ).
cnf(c_0_46,plain,
composition(X1,join(one,X2)) = join(X1,composition(X1,X2)),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_47,plain,
join(X1,composition(complement(one),X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_48,negated_conjecture,
( join(complement(join(complement(one),complement(complement(sk1)))),complement(join(complement(one),complement(complement(composition(sk1,top)))))) != complement(join(complement(one),complement(complement(composition(sk1,top)))))
| join(complement(join(complement(one),complement(complement(sk1)))),complement(join(complement(one),complement(complement(composition(sk1,top)))))) != complement(join(complement(one),complement(complement(sk1)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_20]),c_0_25]),c_0_20]),c_0_25]),c_0_20]),c_0_25]),c_0_20]),c_0_25]),c_0_20]),c_0_25]),c_0_20]),c_0_25]),c_0_20]) ).
cnf(c_0_49,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
join(X1,join(X2,composition(sk1,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
join(X1,composition(X1,complement(one))) = composition(X1,top),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_15]),c_0_15]) ).
cnf(c_0_52,negated_conjecture,
( join(complement(join(sk1,complement(one))),complement(join(complement(one),composition(sk1,top)))) != complement(join(complement(one),composition(sk1,top)))
| join(complement(join(sk1,complement(one))),complement(join(complement(one),composition(sk1,top)))) != complement(join(sk1,complement(one))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_49]),c_0_49]),c_0_49]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_53,negated_conjecture,
join(complement(one),composition(sk1,top)) = join(sk1,complement(one)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_53]),c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL027-2 : TPTP v8.1.2. Released v4.0.0.
% 0.14/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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 15:27:14 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.JNGfwpijTy/E---3.1_26662.p
% 0.22/0.62 # Version: 3.1pre001
% 0.22/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.62 # Starting sh5l with 300s (1) cores
% 0.22/0.62 # sh5l with pid 26784 completed with status 0
% 0.22/0.62 # Result found by sh5l
% 0.22/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.62 # Starting sh5l with 300s (1) cores
% 0.22/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.62 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.22/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.62 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.22/0.62 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 26790 completed with status 0
% 0.22/0.62 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.22/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.62 # Starting sh5l with 300s (1) cores
% 0.22/0.62 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.62 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.22/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.62 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.22/0.62 # Preprocessing time : 0.001 s
% 0.22/0.62
% 0.22/0.62 # Proof found!
% 0.22/0.62 # SZS status Unsatisfiable
% 0.22/0.62 # SZS output start CNFRefutation
% See solution above
% 0.22/0.62 # Parsed axioms : 15
% 0.22/0.62 # Removed by relevancy pruning/SinE : 0
% 0.22/0.62 # Initial clauses : 15
% 0.22/0.62 # Removed in clause preprocessing : 0
% 0.22/0.62 # Initial clauses in saturation : 15
% 0.22/0.62 # Processed clauses : 1149
% 0.22/0.62 # ...of these trivial : 657
% 0.22/0.62 # ...subsumed : 191
% 0.22/0.62 # ...remaining for further processing : 301
% 0.22/0.62 # Other redundant clauses eliminated : 0
% 0.22/0.62 # Clauses deleted for lack of memory : 0
% 0.22/0.62 # Backward-subsumed : 0
% 0.22/0.62 # Backward-rewritten : 52
% 0.22/0.62 # Generated clauses : 16379
% 0.22/0.62 # ...of the previous two non-redundant : 7280
% 0.22/0.62 # ...aggressively subsumed : 0
% 0.22/0.62 # Contextual simplify-reflections : 0
% 0.22/0.62 # Paramodulations : 16379
% 0.22/0.62 # Factorizations : 0
% 0.22/0.62 # NegExts : 0
% 0.22/0.62 # Equation resolutions : 0
% 0.22/0.62 # Total rewrite steps : 27500
% 0.22/0.62 # Propositional unsat checks : 0
% 0.22/0.62 # Propositional check models : 0
% 0.22/0.62 # Propositional check unsatisfiable : 0
% 0.22/0.62 # Propositional clauses : 0
% 0.22/0.62 # Propositional clauses after purity: 0
% 0.22/0.62 # Propositional unsat core size : 0
% 0.22/0.62 # Propositional preprocessing time : 0.000
% 0.22/0.62 # Propositional encoding time : 0.000
% 0.22/0.62 # Propositional solver time : 0.000
% 0.22/0.62 # Success case prop preproc time : 0.000
% 0.22/0.62 # Success case prop encoding time : 0.000
% 0.22/0.62 # Success case prop solver time : 0.000
% 0.22/0.62 # Current number of processed clauses : 249
% 0.22/0.62 # Positive orientable unit clauses : 244
% 0.22/0.62 # Positive unorientable unit clauses: 4
% 0.22/0.62 # Negative unit clauses : 0
% 0.22/0.62 # Non-unit-clauses : 1
% 0.22/0.62 # Current number of unprocessed clauses: 6012
% 0.22/0.62 # ...number of literals in the above : 6012
% 0.22/0.62 # Current number of archived formulas : 0
% 0.22/0.62 # Current number of archived clauses : 52
% 0.22/0.62 # Clause-clause subsumption calls (NU) : 2
% 0.22/0.62 # Rec. Clause-clause subsumption calls : 2
% 0.22/0.62 # Non-unit clause-clause subsumptions : 1
% 0.22/0.62 # Unit Clause-clause subsumption calls : 18
% 0.22/0.62 # Rewrite failures with RHS unbound : 0
% 0.22/0.62 # BW rewrite match attempts : 866
% 0.22/0.62 # BW rewrite match successes : 241
% 0.22/0.62 # Condensation attempts : 0
% 0.22/0.62 # Condensation successes : 0
% 0.22/0.62 # Termbank termtop insertions : 159122
% 0.22/0.62
% 0.22/0.62 # -------------------------------------------------
% 0.22/0.62 # User time : 0.114 s
% 0.22/0.62 # System time : 0.008 s
% 0.22/0.62 # Total time : 0.123 s
% 0.22/0.62 # Maximum resident set size: 1616 pages
% 0.22/0.62
% 0.22/0.62 # -------------------------------------------------
% 0.22/0.62 # User time : 0.117 s
% 0.22/0.62 # System time : 0.009 s
% 0.22/0.62 # Total time : 0.126 s
% 0.22/0.62 # Maximum resident set size: 1684 pages
% 0.22/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------