TSTP Solution File: LAT245-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT245-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:14:36 EDT 2024
% Result : Unsatisfiable 60.86s 8.18s
% Output : CNFRefutation 60.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 61 ( 58 unt; 0 nHn; 15 RR)
% Number of literals : 67 ( 66 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 95 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',associativity_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',absorption2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',commutativity_of_join) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',idempotence_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',associativity_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',complement_meet) ).
cnf(equation_H59,axiom,
meet(X1,meet(join(X2,X3),join(X2,X4))) = meet(X1,join(X2,meet(join(X2,X4),join(X3,meet(X1,X2))))),
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',equation_H59) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.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.TCqQZOhrdA/E---3.1_8905.p',meet_join_complement) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',complement_join) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/tmp/tmp.TCqQZOhrdA/E---3.1_8905.p',prove_distributivity) ).
cnf(c_0_14,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_17,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_21,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_23,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_24,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_25,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_26,hypothesis,
join(meet(X1,b),meet(a,X1)) = meet(X1,b),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_29,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_31,hypothesis,
join(a,meet(b,join(X1,a))) = meet(b,join(X1,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]),c_0_23]),c_0_15]) ).
cnf(c_0_32,hypothesis,
meet(a,complement(b)) = meet(a,zero),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_33,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_34,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_35,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_36,hypothesis,
join(X1,meet(b,join(X1,a))) = join(X1,a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_16]) ).
cnf(c_0_38,axiom,
meet(X1,meet(join(X2,X3),join(X2,X4))) = meet(X1,join(X2,meet(join(X2,X4),join(X3,meet(X1,X2))))),
equation_H59 ).
cnf(c_0_39,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_41,plain,
meet(X1,meet(X2,complement(meet(join(X1,X3),X2)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]) ).
cnf(c_0_42,hypothesis,
join(X1,meet(b,join(a,X1))) = join(a,X1),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_43,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_44,hypothesis,
meet(a,meet(join(complement(b),X1),join(complement(b),X2))) = meet(a,join(complement(b),meet(join(complement(b),X2),X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_45,hypothesis,
meet(X1,meet(X2,complement(meet(join(a,X1),X2)))) = zero,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_47,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_48,hypothesis,
meet(a,join(complement(b),meet(join(a,complement(b)),X1))) = meet(a,join(complement(b),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23]),c_0_15]) ).
cnf(c_0_49,hypothesis,
meet(X1,complement(meet(join(a,X1),join(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_34,c_0_45]) ).
cnf(c_0_50,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_46]) ).
cnf(c_0_51,plain,
meet(join(X1,X2),join(X1,join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_52,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_53,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_54,plain,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
c_0_47 ).
cnf(c_0_55,hypothesis,
meet(a,join(complement(b),complement(join(a,complement(b))))) = zero,
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_40]),c_0_32]),c_0_33]),c_0_50]),c_0_25]),c_0_51]) ).
cnf(c_0_56,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_57,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_53 ).
cnf(c_0_58,hypothesis,
join(complement(b),complement(join(a,complement(b)))) = complement(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_57,c_0_23]) ).
cnf(c_0_60,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_58]),c_0_23]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LAT245-1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 08:24:16 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.TCqQZOhrdA/E---3.1_8905.p
% 60.86/8.18 # Version: 3.1.0
% 60.86/8.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 60.86/8.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 60.86/8.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 60.86/8.18 # Starting new_bool_3 with 300s (1) cores
% 60.86/8.18 # Starting new_bool_1 with 300s (1) cores
% 60.86/8.18 # Starting sh5l with 300s (1) cores
% 60.86/8.18 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 9015 completed with status 0
% 60.86/8.18 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 60.86/8.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 60.86/8.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 60.86/8.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 60.86/8.18 # No SInE strategy applied
% 60.86/8.18 # Search class: FHUPM-FFSF21-MFFFFFNN
% 60.86/8.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 60.86/8.18 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 60.86/8.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 60.86/8.18 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 60.86/8.18 # Starting new_bool_3 with 136s (1) cores
% 60.86/8.18 # Starting new_bool_1 with 136s (1) cores
% 60.86/8.18 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 9023 completed with status 0
% 60.86/8.18 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 60.86/8.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 60.86/8.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 60.86/8.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 60.86/8.18 # No SInE strategy applied
% 60.86/8.18 # Search class: FHUPM-FFSF21-MFFFFFNN
% 60.86/8.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 60.86/8.18 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 60.86/8.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 60.86/8.18 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 60.86/8.18 # Preprocessing time : 0.001 s
% 60.86/8.18 # Presaturation interreduction done
% 60.86/8.18
% 60.86/8.18 # Proof found!
% 60.86/8.18 # SZS status Unsatisfiable
% 60.86/8.18 # SZS output start CNFRefutation
% See solution above
% 60.86/8.18 # Parsed axioms : 14
% 60.86/8.18 # Removed by relevancy pruning/SinE : 0
% 60.86/8.18 # Initial clauses : 14
% 60.86/8.18 # Removed in clause preprocessing : 0
% 60.86/8.18 # Initial clauses in saturation : 14
% 60.86/8.18 # Processed clauses : 24754
% 60.86/8.18 # ...of these trivial : 12750
% 60.86/8.18 # ...subsumed : 10498
% 60.86/8.18 # ...remaining for further processing : 1506
% 60.86/8.18 # Other redundant clauses eliminated : 0
% 60.86/8.18 # Clauses deleted for lack of memory : 0
% 60.86/8.18 # Backward-subsumed : 20
% 60.86/8.18 # Backward-rewritten : 183
% 60.86/8.18 # Generated clauses : 837766
% 60.86/8.18 # ...of the previous two non-redundant : 341222
% 60.86/8.18 # ...aggressively subsumed : 0
% 60.86/8.18 # Contextual simplify-reflections : 0
% 60.86/8.18 # Paramodulations : 837749
% 60.86/8.18 # Factorizations : 0
% 60.86/8.18 # NegExts : 0
% 60.86/8.18 # Equation resolutions : 17
% 60.86/8.18 # Disequality decompositions : 0
% 60.86/8.18 # Total rewrite steps : 2339898
% 60.86/8.18 # ...of those cached : 2103549
% 60.86/8.18 # Propositional unsat checks : 0
% 60.86/8.18 # Propositional check models : 0
% 60.86/8.18 # Propositional check unsatisfiable : 0
% 60.86/8.18 # Propositional clauses : 0
% 60.86/8.18 # Propositional clauses after purity: 0
% 60.86/8.18 # Propositional unsat core size : 0
% 60.86/8.18 # Propositional preprocessing time : 0.000
% 60.86/8.18 # Propositional encoding time : 0.000
% 60.86/8.18 # Propositional solver time : 0.000
% 60.86/8.18 # Success case prop preproc time : 0.000
% 60.86/8.18 # Success case prop encoding time : 0.000
% 60.86/8.18 # Success case prop solver time : 0.000
% 60.86/8.18 # Current number of processed clauses : 1289
% 60.86/8.18 # Positive orientable unit clauses : 1145
% 60.86/8.18 # Positive unorientable unit clauses: 10
% 60.86/8.18 # Negative unit clauses : 1
% 60.86/8.18 # Non-unit-clauses : 133
% 60.86/8.18 # Current number of unprocessed clauses: 315772
% 60.86/8.18 # ...number of literals in the above : 340291
% 60.86/8.18 # Current number of archived formulas : 0
% 60.86/8.18 # Current number of archived clauses : 217
% 60.86/8.18 # Clause-clause subsumption calls (NU) : 17233
% 60.86/8.18 # Rec. Clause-clause subsumption calls : 17233
% 60.86/8.18 # Non-unit clause-clause subsumptions : 5872
% 60.86/8.18 # Unit Clause-clause subsumption calls : 787
% 60.86/8.18 # Rewrite failures with RHS unbound : 0
% 60.86/8.18 # BW rewrite match attempts : 19779
% 60.86/8.18 # BW rewrite match successes : 2496
% 60.86/8.18 # Condensation attempts : 0
% 60.86/8.18 # Condensation successes : 0
% 60.86/8.18 # Termbank termtop insertions : 14081954
% 60.86/8.18 # Search garbage collected termcells : 8
% 60.86/8.18
% 60.86/8.18 # -------------------------------------------------
% 60.86/8.18 # User time : 7.270 s
% 60.86/8.18 # System time : 0.268 s
% 60.86/8.18 # Total time : 7.537 s
% 60.86/8.18 # Maximum resident set size: 1596 pages
% 60.86/8.18
% 60.86/8.18 # -------------------------------------------------
% 60.86/8.18 # User time : 36.882 s
% 60.86/8.18 # System time : 0.812 s
% 60.86/8.18 # Total time : 37.695 s
% 60.86/8.18 # Maximum resident set size: 1688 pages
% 60.86/8.18 % E---3.1 exiting
% 60.86/8.18 % E exiting
%------------------------------------------------------------------------------