TSTP Solution File: LAT225-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT225-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 18:08:05 EDT 2023
% Result : Unsatisfiable 53.72s 7.33s
% Output : CNFRefutation 53.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 67 ( 59 unt; 0 nHn; 26 RR)
% Number of literals : 79 ( 78 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 96 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(equation_H10,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X3,join(X1,meet(X2,X3))))),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',equation_H10) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',prove_distributivity_hypothesis) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',idempotence_of_join) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',meet_join_complement) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',associativity_of_meet) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',complement_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p',prove_distributivity) ).
cnf(c_0_13,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X3,join(X1,meet(X2,X3))))),
equation_H10 ).
cnf(c_0_14,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_15,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_16,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_17,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_18,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_19,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_20,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_21,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_22,plain,
meet(X1,join(X2,meet(X3,join(meet(X2,X3),X1)))) = meet(X1,join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_26,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
meet(complement(meet(X1,X2)),join(X1,meet(X2,complement(meet(X1,X2))))) = meet(join(X1,X2),complement(meet(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_23]),c_0_18]),c_0_18]) ).
cnf(c_0_28,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_20]) ).
cnf(c_0_30,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_31,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_32,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_33,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_34,hypothesis,
meet(complement(a),join(a,meet(b,complement(a)))) = meet(b,complement(a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28]) ).
cnf(c_0_35,plain,
join(X1,join(X2,meet(X3,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_36,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_37,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_38,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_40,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_41,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_42,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_43,hypothesis,
meet(complement(meet(b,complement(a))),join(complement(a),meet(join(a,meet(b,complement(a))),complement(meet(b,complement(a)))))) = complement(meet(b,complement(a))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_34]),c_0_35]),c_0_16]),c_0_36]) ).
cnf(c_0_44,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
join(X1,join(X2,join(X3,X1))) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_46,plain,
( complement(meet(X1,X2)) = X3
| meet(X2,meet(X3,X1)) != zero
| join(meet(X1,X2),X3) != one ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,hypothesis,
meet(complement(a),meet(join(a,meet(b,complement(a))),complement(meet(b,complement(a))))) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_48,hypothesis,
meet(complement(a),join(a,join(meet(b,complement(a)),meet(complement(a),complement(meet(b,complement(a))))))) = complement(a),
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_13,c_0_43]),c_0_20]),c_0_16]),c_0_30]),c_0_23]),c_0_20]) ).
cnf(c_0_49,plain,
join(X1,join(X2,join(X3,complement(X1)))) = one,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,hypothesis,
( complement(meet(complement(a),complement(meet(b,complement(a))))) = join(a,meet(b,complement(a)))
| join(a,join(meet(b,complement(a)),meet(complement(a),complement(meet(b,complement(a)))))) != one ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_18]),c_0_18]),c_0_14]),c_0_20]) ).
cnf(c_0_51,hypothesis,
join(a,join(meet(b,complement(a)),meet(complement(a),complement(meet(b,complement(a)))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_48]),c_0_20]),c_0_20]),c_0_49]) ).
cnf(c_0_52,plain,
( complement(meet(X1,complement(meet(X2,X1)))) = X2
| join(X2,meet(X1,complement(meet(X2,X1)))) != one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_42]),c_0_14]) ).
cnf(c_0_53,hypothesis,
complement(meet(complement(a),complement(meet(b,complement(a))))) = join(a,meet(b,complement(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_54,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_14]),c_0_16])]) ).
cnf(c_0_55,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_56,hypothesis,
( join(a,meet(b,complement(a))) = b
| join(b,meet(complement(a),complement(meet(b,complement(a))))) != one ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(join(a,meet(b,complement(a)))),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_58,plain,
join(X1,join(X2,join(meet(X1,X3),X4))) = join(X2,join(X1,X4)),
inference(spm,[status(thm)],[c_0_29,c_0_55]) ).
cnf(c_0_59,hypothesis,
join(a,join(b,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_60,hypothesis,
( join(a,meet(b,complement(a))) = b
| join(b,complement(join(a,meet(b,complement(a))))) != one ),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,hypothesis,
join(b,complement(join(a,meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_51]),c_0_30]),c_0_59]),c_0_57]) ).
cnf(c_0_62,hypothesis,
join(a,meet(b,complement(a))) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_63,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_64,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(rw,[status(thm)],[c_0_57,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_63,c_0_14]) ).
cnf(c_0_66,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_64]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LAT225-1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n004.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 10:11:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.5bF1jg0Y8u/E---3.1_1166.p
% 53.72/7.33 # Version: 3.1pre001
% 53.72/7.33 # Preprocessing class: FSSSSMSSSSSNFFN.
% 53.72/7.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.72/7.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 53.72/7.33 # Starting new_bool_3 with 300s (1) cores
% 53.72/7.33 # Starting new_bool_1 with 300s (1) cores
% 53.72/7.33 # Starting sh5l with 300s (1) cores
% 53.72/7.33 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1244 completed with status 0
% 53.72/7.33 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 53.72/7.33 # Preprocessing class: FSSSSMSSSSSNFFN.
% 53.72/7.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.72/7.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 53.72/7.33 # No SInE strategy applied
% 53.72/7.33 # Search class: FHUPM-FFSF21-MFFFFFNN
% 53.72/7.33 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 53.72/7.33 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 53.72/7.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 53.72/7.33 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 53.72/7.33 # Starting new_bool_3 with 136s (1) cores
% 53.72/7.33 # Starting new_bool_1 with 136s (1) cores
% 53.72/7.33 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1251 completed with status 0
% 53.72/7.33 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 53.72/7.33 # Preprocessing class: FSSSSMSSSSSNFFN.
% 53.72/7.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.72/7.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 53.72/7.33 # No SInE strategy applied
% 53.72/7.33 # Search class: FHUPM-FFSF21-MFFFFFNN
% 53.72/7.33 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 53.72/7.33 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 53.72/7.33 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 53.72/7.33 # Preprocessing time : 0.001 s
% 53.72/7.33
% 53.72/7.33 # Proof found!
% 53.72/7.33 # SZS status Unsatisfiable
% 53.72/7.33 # SZS output start CNFRefutation
% See solution above
% 53.72/7.33 # Parsed axioms : 14
% 53.72/7.33 # Removed by relevancy pruning/SinE : 0
% 53.72/7.33 # Initial clauses : 14
% 53.72/7.33 # Removed in clause preprocessing : 0
% 53.72/7.33 # Initial clauses in saturation : 14
% 53.72/7.33 # Processed clauses : 7960
% 53.72/7.33 # ...of these trivial : 1073
% 53.72/7.33 # ...subsumed : 6147
% 53.72/7.33 # ...remaining for further processing : 740
% 53.72/7.33 # Other redundant clauses eliminated : 0
% 53.72/7.33 # Clauses deleted for lack of memory : 0
% 53.72/7.33 # Backward-subsumed : 75
% 53.72/7.33 # Backward-rewritten : 65
% 53.72/7.33 # Generated clauses : 243320
% 53.72/7.33 # ...of the previous two non-redundant : 188400
% 53.72/7.33 # ...aggressively subsumed : 0
% 53.72/7.33 # Contextual simplify-reflections : 5
% 53.72/7.33 # Paramodulations : 243318
% 53.72/7.33 # Factorizations : 0
% 53.72/7.33 # NegExts : 0
% 53.72/7.33 # Equation resolutions : 2
% 53.72/7.33 # Total rewrite steps : 457465
% 53.72/7.33 # Propositional unsat checks : 0
% 53.72/7.33 # Propositional check models : 0
% 53.72/7.33 # Propositional check unsatisfiable : 0
% 53.72/7.33 # Propositional clauses : 0
% 53.72/7.33 # Propositional clauses after purity: 0
% 53.72/7.33 # Propositional unsat core size : 0
% 53.72/7.33 # Propositional preprocessing time : 0.000
% 53.72/7.33 # Propositional encoding time : 0.000
% 53.72/7.33 # Propositional solver time : 0.000
% 53.72/7.33 # Success case prop preproc time : 0.000
% 53.72/7.33 # Success case prop encoding time : 0.000
% 53.72/7.33 # Success case prop solver time : 0.000
% 53.72/7.33 # Current number of processed clauses : 600
% 53.72/7.33 # Positive orientable unit clauses : 401
% 53.72/7.33 # Positive unorientable unit clauses: 8
% 53.72/7.33 # Negative unit clauses : 51
% 53.72/7.33 # Non-unit-clauses : 140
% 53.72/7.33 # Current number of unprocessed clauses: 179857
% 53.72/7.33 # ...number of literals in the above : 262107
% 53.72/7.33 # Current number of archived formulas : 0
% 53.72/7.33 # Current number of archived clauses : 140
% 53.72/7.33 # Clause-clause subsumption calls (NU) : 8571
% 53.72/7.33 # Rec. Clause-clause subsumption calls : 7342
% 53.72/7.33 # Non-unit clause-clause subsumptions : 671
% 53.72/7.33 # Unit Clause-clause subsumption calls : 541
% 53.72/7.33 # Rewrite failures with RHS unbound : 0
% 53.72/7.33 # BW rewrite match attempts : 9386
% 53.72/7.33 # BW rewrite match successes : 278
% 53.72/7.33 # Condensation attempts : 0
% 53.72/7.33 # Condensation successes : 0
% 53.72/7.33 # Termbank termtop insertions : 5554145
% 53.72/7.33
% 53.72/7.33 # -------------------------------------------------
% 53.72/7.33 # User time : 6.500 s
% 53.72/7.33 # System time : 0.234 s
% 53.72/7.33 # Total time : 6.734 s
% 53.72/7.33 # Maximum resident set size: 1592 pages
% 53.72/7.33
% 53.72/7.33 # -------------------------------------------------
% 53.72/7.33 # User time : 32.277 s
% 53.72/7.33 # System time : 0.688 s
% 53.72/7.33 # Total time : 32.965 s
% 53.72/7.33 # Maximum resident set size: 1676 pages
% 53.72/7.33 % E---3.1 exiting
% 53.72/7.33 % E---3.1 exiting
%------------------------------------------------------------------------------